/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
hashtable.h | 779 __bucket_type* __p = __alloc.allocate(__n); local 780 __builtin_memset(__p, 0, __n * sizeof(__bucket_type)); 781 return __p; 791 _M_deallocate_buckets(__bucket_type* __p, size_type __n) 794 __alloc.deallocate(__p, __n); 1025 __node_type* __p = _M_find_node(__n, __k, __code); local 1042 __node_type* __p = _M_find_node(__n, __k, __code); local 1059 __node_type* __p = _M_bucket_begin(__n); local 1097 __node_type* __p = _M_find_node(__n, __k, __code); local 1130 __node_type* __p = _M_find_node(__n, __k, __code); local 1568 __node_type* __p = __n->_M_next(); local 1702 __node_type* __p = _M_begin(); local 1743 __node_type* __p = _M_begin(); local [all...] |
hashtable_policy.h | 209 _Node_iterator_base(__node_type* __p) 210 : _M_cur(__p) { } 253 _Node_iterator(__node_type* __p) 254 : __base_type(__p) { } 301 _Node_const_iterator(__node_type* __p) 302 : __base_type(__p) { } 489 __node_type* __p = __h->_M_find_node(__n, __k, __code); local 491 if (!__p) 493 __p = __h->_M_allocate_node(std::piecewise_construct, 496 return __h->_M_insert_unique_node(__n, __code, __p)->second 515 __node_type* __p = __h->_M_find_node(__n, __k, __code); local 541 __node_type* __p = __h->_M_find_node(__n, __k, __code); local 561 __node_type* __p = __h->_M_find_node(__n, __k, __code); local [all...] |
random.h | 851 * 0 <= @p __r <= @p __p 853 template<typename _RandomNumberEngine, size_t __p, size_t __r> 856 static_assert(1 <= __r && __r <= __p, 864 static constexpr size_t block_size = __p; 3762 double __p; local 3763 __is >> __p; local [all...] |
stl_list.h | 337 _M_put_node(_List_node<_Tp>* __p) 338 { _M_impl._Node_alloc_type::deallocate(__p, 1); } 484 _Node* __p = this->_M_get_node(); local 488 (std::__addressof(__p->_M_data), __x); 492 _M_put_node(__p); 495 return __p; 502 _Node* __p = this->_M_get_node(); 505 _M_get_Node_allocator().construct(__p, 510 _M_put_node(__p); 513 return __p; [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/tr1/ |
hashtable.h | 467 _Node* __p = __array[__i]; local 468 while (__p) 470 _Node* __tmp = __p; 471 __p = __p->_M_next; 493 _Node** __p = __alloc.allocate(__n + 1); local 494 std::fill(__p, __p + __n, (_Node*) 0); 495 __p[__n] = reinterpret_cast<_Node*>(0x1000); 496 return __p; 698 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); local 715 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); local 758 _Node* __p = _M_find_node(*__head, __k, __code); local 796 _Node* __p = _M_find_node(*__head, __k, __code); local 1052 _Node* __p = *__slot; local 1067 _Node* __p = *__saved_slot; local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/backward/ |
hashtable.h | 311 _M_put_node(_Node* __p) 312 { _M_node_allocator.deallocate(__p, 1); } 942 _Node* __p = __it._M_cur; local 943 if (__p) 945 const size_type __n = _M_bkt_num(__p->_M_val); 948 if (__cur == __p) 959 if (__next == __p) [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
forward_list.h | 370 _M_put_node(_Node* __p) 371 { _Node_alloc_traits::deallocate(_M_get_Node_allocator(), __p, 1); } local [all...] |
hashtable.h | 779 __bucket_type* __p = __alloc.allocate(__n); local 780 __builtin_memset(__p, 0, __n * sizeof(__bucket_type)); 781 return __p; 791 _M_deallocate_buckets(__bucket_type* __p, size_type __n) 794 __alloc.deallocate(__p, __n); 1025 __node_type* __p = _M_find_node(__n, __k, __code); local 1042 __node_type* __p = _M_find_node(__n, __k, __code); local 1059 __node_type* __p = _M_bucket_begin(__n); local 1097 __node_type* __p = _M_find_node(__n, __k, __code); local 1130 __node_type* __p = _M_find_node(__n, __k, __code); local 1568 __node_type* __p = __n->_M_next(); local 1702 __node_type* __p = _M_begin(); local 1743 __node_type* __p = _M_begin(); local [all...] |
hashtable_policy.h | 209 _Node_iterator_base(__node_type* __p) 210 : _M_cur(__p) { } 253 _Node_iterator(__node_type* __p) 254 : __base_type(__p) { } 301 _Node_const_iterator(__node_type* __p) 302 : __base_type(__p) { } 489 __node_type* __p = __h->_M_find_node(__n, __k, __code); local 491 if (!__p) 493 __p = __h->_M_allocate_node(std::piecewise_construct, 496 return __h->_M_insert_unique_node(__n, __code, __p)->second 515 __node_type* __p = __h->_M_find_node(__n, __k, __code); local 541 __node_type* __p = __h->_M_find_node(__n, __k, __code); local 561 __node_type* __p = __h->_M_find_node(__n, __k, __code); local [all...] |
random.h | 851 * 0 <= @p __r <= @p __p 853 template<typename _RandomNumberEngine, size_t __p, size_t __r> 856 static_assert(1 <= __r && __r <= __p, 864 static constexpr size_t block_size = __p; 3762 double __p; local 3763 __is >> __p; local [all...] |
stl_list.h | 337 _M_put_node(_List_node<_Tp>* __p) 338 { _M_impl._Node_alloc_type::deallocate(__p, 1); } 484 _Node* __p = this->_M_get_node(); local 488 (std::__addressof(__p->_M_data), __x); 492 _M_put_node(__p); 495 return __p; 502 _Node* __p = this->_M_get_node(); 505 _M_get_Node_allocator().construct(__p, 510 _M_put_node(__p); 513 return __p; [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/ |
hashtable.h | 467 _Node* __p = __array[__i]; local 468 while (__p) 470 _Node* __tmp = __p; 471 __p = __p->_M_next; 493 _Node** __p = __alloc.allocate(__n + 1); local 494 std::fill(__p, __p + __n, (_Node*) 0); 495 __p[__n] = reinterpret_cast<_Node*>(0x1000); 496 return __p; 698 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); local 715 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); local 758 _Node* __p = _M_find_node(*__head, __k, __code); local 796 _Node* __p = _M_find_node(*__head, __k, __code); local 1052 _Node* __p = *__slot; local 1067 _Node* __p = *__saved_slot; local [all...] |
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/backward/ |
hashtable.h | 295 _M_put_node(_Node* __p) 296 { _M_node_allocator.deallocate(__p, 1); } 923 _Node* __p = __it._M_cur; local 924 if (__p) 926 const size_type __n = _M_bkt_num(__p->_M_val); 929 if (__cur == __p) 940 if (__next == __p) [all...] |
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
shared_ptr.h | 73 _Sp_counted_ptr(_Ptr __p) 74 : _M_ptr(__p) { } 120 * @pre __d(__p) must not throw. 122 _Sp_counted_deleter(_Ptr __p, _Deleter __d) 123 : _Base_type(__p), _M_del(__d, _Alloc()) { } 127 * @pre __d(__p) must not throw. 129 _Sp_counted_deleter(_Ptr __p, _Deleter __d, const _Alloc& __a) 130 : _Base_type(__p), _M_del(__d, __a) { } 157 void operator()(_Tp* __p) const { if (__p) __p->~_Tp(); 174 void* __p = &_M_storage; local 184 void* __p = &_M_storage; local 861 void* __p = _M_refcount._M_get_deleter(typeid(__tag)); local [all...] |
stl_list.h | 319 _M_put_node(_List_node<_Tp>* __p) 320 { _M_impl._Node_alloc_type::deallocate(__p, 1); } 461 _Node* __p = this->_M_get_node(); local 464 _M_get_Tp_allocator().construct(&__p->_M_data, __x); 468 _M_put_node(__p); 471 return __p; 478 _Node* __p = this->_M_get_node(); 481 _M_get_Node_allocator().construct(__p, 486 _M_put_node(__p); 489 return __p; [all...] |
/prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
_list.h | 285 _Node* __p = this->_M_node.allocate(1); local 287 _Copy_Construct(&__p->_M_data, __x); 289 _STLP_UNWIND(this->_M_node.deallocate(__p, 1)) 290 return __p; 295 _Node* __p = this->_M_node.allocate(1); local 297 _STLP_STD::_Construct(&__p->_M_data); 299 _STLP_UNWIND(this->_M_node.deallocate(__p, 1)) 300 return __p; 427 _Node_base* __p = __n->_M_prev; local 429 __tmp->_M_prev = __p; 652 _Node_base* __p = &this->_M_node._M_data; local [all...] |
_tree.h | 377 _Base_ptr _M_copy(_Base_ptr __x, _Base_ptr __p); 503 pair<iterator,iterator> __p = equal_range(__x); local 504 size_type __n = _STLP_STD::distance(__p.first, __p.second); 505 erase(__p.first, __p.second); 597 pair<const_iterator, const_iterator> __p = equal_range(__x); local 598 return _STLP_STD::distance(__p.first, __p.second); 616 pair<iterator, iterator> __p; local 629 pair<const_iterator, const_iterator> __p; local [all...] |
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/backward/ |
hashtable.h | 295 _M_put_node(_Node* __p) 296 { _M_node_allocator.deallocate(__p, 1); } 923 _Node* __p = __it._M_cur; local 924 if (__p) 926 const size_type __n = _M_bkt_num(__p->_M_val); 929 if (__cur == __p) 940 if (__next == __p) [all...] |
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
shared_ptr.h | 73 _Sp_counted_ptr(_Ptr __p) 74 : _M_ptr(__p) { } 120 * @pre __d(__p) must not throw. 122 _Sp_counted_deleter(_Ptr __p, _Deleter __d) 123 : _Base_type(__p), _M_del(__d, _Alloc()) { } 127 * @pre __d(__p) must not throw. 129 _Sp_counted_deleter(_Ptr __p, _Deleter __d, const _Alloc& __a) 130 : _Base_type(__p), _M_del(__d, __a) { } 157 void operator()(_Tp* __p) const { if (__p) __p->~_Tp(); 174 void* __p = &_M_storage; local 184 void* __p = &_M_storage; local 861 void* __p = _M_refcount._M_get_deleter(typeid(__tag)); local [all...] |
stl_list.h | 319 _M_put_node(_List_node<_Tp>* __p) 320 { _M_impl._Node_alloc_type::deallocate(__p, 1); } 461 _Node* __p = this->_M_get_node(); local 464 _M_get_Tp_allocator().construct(&__p->_M_data, __x); 468 _M_put_node(__p); 471 return __p; 478 _Node* __p = this->_M_get_node(); 481 _M_get_Node_allocator().construct(__p, 486 _M_put_node(__p); 489 return __p; [all...] |
/prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
_list.h | 285 _Node* __p = this->_M_node.allocate(1); local 287 _Copy_Construct(&__p->_M_data, __x); 289 _STLP_UNWIND(this->_M_node.deallocate(__p, 1)) 290 return __p; 295 _Node* __p = this->_M_node.allocate(1); local 297 _STLP_STD::_Construct(&__p->_M_data); 299 _STLP_UNWIND(this->_M_node.deallocate(__p, 1)) 300 return __p; 427 _Node_base* __p = __n->_M_prev; local 429 __tmp->_M_prev = __p; 652 _Node_base* __p = &this->_M_node._M_data; local [all...] |
_tree.h | 377 _Base_ptr _M_copy(_Base_ptr __x, _Base_ptr __p); 503 pair<iterator,iterator> __p = equal_range(__x); local 504 size_type __n = _STLP_STD::distance(__p.first, __p.second); 505 erase(__p.first, __p.second); 597 pair<const_iterator, const_iterator> __p = equal_range(__x); local 598 return _STLP_STD::distance(__p.first, __p.second); 616 pair<iterator, iterator> __p; local 629 pair<const_iterator, const_iterator> __p; local [all...] |
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/backward/ |
hashtable.h | 295 _M_put_node(_Node* __p) 296 { _M_node_allocator.deallocate(__p, 1); } 923 _Node* __p = __it._M_cur; local 924 if (__p) 926 const size_type __n = _M_bkt_num(__p->_M_val); 929 if (__cur == __p) 940 if (__next == __p) [all...] |
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
shared_ptr.h | 73 _Sp_counted_ptr(_Ptr __p) 74 : _M_ptr(__p) { } 120 * @pre __d(__p) must not throw. 122 _Sp_counted_deleter(_Ptr __p, _Deleter __d) 123 : _Base_type(__p), _M_del(__d, _Alloc()) { } 127 * @pre __d(__p) must not throw. 129 _Sp_counted_deleter(_Ptr __p, _Deleter __d, const _Alloc& __a) 130 : _Base_type(__p), _M_del(__d, __a) { } 157 void operator()(_Tp* __p) const { if (__p) __p->~_Tp(); 174 void* __p = &_M_storage; local 184 void* __p = &_M_storage; local 861 void* __p = _M_refcount._M_get_deleter(typeid(__tag)); local [all...] |
stl_list.h | 319 _M_put_node(_List_node<_Tp>* __p) 320 { _M_impl._Node_alloc_type::deallocate(__p, 1); } 461 _Node* __p = this->_M_get_node(); local 464 _M_get_Tp_allocator().construct(&__p->_M_data, __x); 468 _M_put_node(__p); 471 return __p; 478 _Node* __p = this->_M_get_node(); 481 _M_get_Node_allocator().construct(__p, 486 _M_put_node(__p); 489 return __p; [all...] |