HomeSort by relevance Sort by last modified time
    Searched refs:__p1 (Results 1 - 25 of 37) sorted by null

1 2

  /external/stlport/stlport/stl/
_slist.c 72 _Node_base* __p1 = &this->_M_head._M_data;
77 __p1 = __n1;
82 this->_M_erase_after(__p1, 0);
84 _M_insert_after_range(__p1, const_iterator(__CONST_CAST(_Node_base*, __n2)),
_algobase.c 237 _ForwardIter2 __p1(__first2);
239 if ( ++__p1 == __last2 ) {
255 _ForwardIter2 __p = __p1;
_algo.c 121 _ForwardIter2 __p1(__first2);
123 if ( ++__p1 == __last2 )
133 _ForwardIter2 __p = __p1;
    [all...]
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_slist.c 72 _Node_base* __p1 = &this->_M_head._M_data;
77 __p1 = __n1;
82 this->_M_erase_after(__p1, 0);
84 _M_insert_after_range(__p1, const_iterator(__CONST_CAST(_Node_base*, __n2)),
_algobase.c 237 _ForwardIter2 __p1(__first2);
239 if ( ++__p1 == __last2 ) {
255 _ForwardIter2 __p = __p1;
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_slist.c 72 _Node_base* __p1 = &this->_M_head._M_data;
77 __p1 = __n1;
82 this->_M_erase_after(__p1, 0);
84 _M_insert_after_range(__p1, const_iterator(__CONST_CAST(_Node_base*, __n2)),
_algobase.c 237 _ForwardIter2 __p1(__first2);
239 if ( ++__p1 == __last2 ) {
255 _ForwardIter2 __p = __p1;
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_slist.c 72 _Node_base* __p1 = &this->_M_head._M_data;
77 __p1 = __n1;
82 this->_M_erase_after(__p1, 0);
84 _M_insert_after_range(__p1, const_iterator(__CONST_CAST(_Node_base*, __n2)),
_algobase.c 237 _ForwardIter2 __p1(__first2);
239 if ( ++__p1 == __last2 ) {
255 _ForwardIter2 __p = __p1;
  /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/
_slist.c 72 _Node_base* __p1 = &this->_M_head._M_data;
77 __p1 = __n1;
82 this->_M_erase_after(__p1, 0);
84 _M_insert_after_range(__p1, const_iterator(__CONST_CAST(_Node_base*, __n2)),
_algobase.c 237 _ForwardIter2 __p1(__first2);
239 if ( ++__p1 == __last2 ) {
255 _ForwardIter2 __p = __p1;
  /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/
_slist.c 72 _Node_base* __p1 = &this->_M_head._M_data;
77 __p1 = __n1;
82 this->_M_erase_after(__p1, 0);
84 _M_insert_after_range(__p1, const_iterator(__CONST_CAST(_Node_base*, __n2)),
_algobase.c 237 _ForwardIter2 __p1(__first2);
239 if ( ++__p1 == __last2 ) {
255 _ForwardIter2 __p = __p1;
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/
random.h 944 template<typename _RandomNumberEngine1, size_t __p1, size_t __r1,
949 __p1, __r1>&);
    [all...]
atomic_2.h 614 compare_exchange_strong(__pointer_type& __p1, __pointer_type __p2,
621 __pointer_type __p1o = __p1;
625 __p1 = __p1n;
630 compare_exchange_strong(__pointer_type& __p1, __pointer_type __p2,
637 __pointer_type __p1o = __p1;
641 __p1 = __p1n;
hashtable.h 829 _Node* __p1 = __p->_M_next; local
830 for (; __p1; __p1 = __p1->_M_next)
831 if (!this->_M_compare(__k, __code, __p1))
835 iterator __last(__p1, __head);
836 if (!__p1)
867 _Node* __p1 = __p->_M_next; local
868 for (; __p1; __p1 = __p1->_M_next
    [all...]
atomic_0.h 605 __pointer_type& __p1 = reinterpret_cast<void*&>(__rp1); local
606 return _ATOMIC_CMPEXCHNG_(this, &__p1, __p2, __m1);
616 __pointer_type& __p1 = reinterpret_cast<void*&>(__rp1); local
617 return _ATOMIC_CMPEXCHNG_(this, &__p1, __p2, __m1);
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/
random.h 944 template<typename _RandomNumberEngine1, size_t __p1, size_t __r1,
949 __p1, __r1>&);
    [all...]
atomic_2.h 614 compare_exchange_strong(__pointer_type& __p1, __pointer_type __p2,
621 __pointer_type __p1o = __p1;
625 __p1 = __p1n;
630 compare_exchange_strong(__pointer_type& __p1, __pointer_type __p2,
637 __pointer_type __p1o = __p1;
641 __p1 = __p1n;
hashtable.h 829 _Node* __p1 = __p->_M_next; local
830 for (; __p1; __p1 = __p1->_M_next)
831 if (!this->_M_compare(__k, __code, __p1))
835 iterator __last(__p1, __head);
836 if (!__p1)
867 _Node* __p1 = __p->_M_next; local
868 for (; __p1; __p1 = __p1->_M_next
    [all...]
atomic_0.h 605 __pointer_type& __p1 = reinterpret_cast<void*&>(__rp1); local
606 return _ATOMIC_CMPEXCHNG_(this, &__p1, __p2, __m1);
616 __pointer_type& __p1 = reinterpret_cast<void*&>(__rp1); local
617 return _ATOMIC_CMPEXCHNG_(this, &__p1, __p2, __m1);
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/
hashtable.h 762 _Node* __p1 = __p->_M_next; local
763 for (; __p1; __p1 = __p1->_M_next)
764 if (!this->_M_compare(__k, __code, __p1))
768 iterator __last(__p1, __head);
769 if (!__p1)
800 _Node* __p1 = __p->_M_next; local
801 for (; __p1; __p1 = __p1->_M_next
    [all...]
random.h     [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/
hashtable.h 762 _Node* __p1 = __p->_M_next; local
763 for (; __p1; __p1 = __p1->_M_next)
764 if (!this->_M_compare(__k, __code, __p1))
768 iterator __last(__p1, __head);
769 if (!__p1)
800 _Node* __p1 = __p->_M_next; local
801 for (; __p1; __p1 = __p1->_M_next
    [all...]
random.h     [all...]

Completed in 492 milliseconds

1 2