/prebuilts/ndk/7/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/8/sources/cxx-stl/gnu-libstdc++/4.4.3/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/8/sources/cxx-stl/gnu-libstdc++/4.4.3/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/8/sources/cxx-stl/gnu-libstdc++/4.6/include/backward/ |
hashtable.h | 313 _M_put_node(_Node* __p) 314 { _M_node_allocator.deallocate(__p, 1); } 943 _Node* __p = __it._M_cur; local 944 if (__p) 946 const size_type __n = _M_bkt_num(__p->_M_val); 949 if (__cur == __p) 960 if (__next == __p) [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
hashtable.h | 520 _Node* __p = __array[__i]; local 521 while (__p) 523 _Node* __tmp = __p; 524 __p = __p->_M_next; 546 _Node** __p = __alloc.allocate(__n + 1); local 547 std::fill(__p, __p + __n, (_Node*) 0); 548 __p[__n] = reinterpret_cast<_Node*>(0x1000); 549 return __p; 765 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); local 782 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); local 825 _Node* __p = _M_find_node(*__head, __k, __code); local 863 _Node* __p = _M_find_node(*__head, __k, __code); local 1109 _Node* __p = *__slot; local 1124 _Node* __p = *__saved_slot; local [all...] |
shared_ptr_base.h | 288 _Sp_counted_ptr(_Ptr __p) 289 : _M_ptr(__p) { } 341 // __d(__p) must not throw. 342 _Sp_counted_deleter(_Ptr __p, _Deleter __d) 343 : _M_ptr(__p), _M_del(__d, _Alloc()) { } 345 // __d(__p) must not throw. 346 _Sp_counted_deleter(_Ptr __p, _Deleter __d, const _Alloc& __a) 347 : _M_ptr(__p), _M_del(__d, __a) { } 381 void operator()(_Tp* __p) const { if (__p) __p->~_Tp(); 399 void* __p = &_M_storage; local 409 void* __p = &_M_storage; local 991 void* __p = _M_refcount._M_get_deleter(typeid(__tag)); local [all...] |
stl_list.h | 330 _M_put_node(_List_node<_Tp>* __p) 331 { _M_impl._Node_alloc_type::deallocate(__p, 1); } 473 _Node* __p = this->_M_get_node(); local 477 (std::__addressof(__p->_M_data), __x); 481 _M_put_node(__p); 484 return __p; 491 _Node* __p = this->_M_get_node(); 494 _M_get_Node_allocator().construct(__p, 499 _M_put_node(__p); 502 return __p; [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/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/8/sources/cxx-stl/gnu-libstdc++/4.7/include/backward/ |
hashtable.h | 312 _M_put_node(_Node* __p) 313 { _M_node_allocator.deallocate(__p, 1); } 943 _Node* __p = __it._M_cur; local 944 if (__p) 946 const size_type __n = _M_bkt_num(__p->_M_val); 949 if (__cur == __p) 960 if (__next == __p) [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
hashtable.h | 681 _Bucket* __p = __alloc.allocate(__n); local 682 __builtin_memset(__p, 0, __n * sizeof(_Bucket)); 683 return __p; 693 _M_deallocate_buckets(_Bucket* __p, size_type __n) 696 __alloc.deallocate(__p, __n); 939 _Node* __p = _M_find_node(__n, __k, __code); local 956 _Node* __p = _M_find_node(__n, __k, __code); local 973 _Node* __p = _M_bucket_begin(__n); local 1011 _Node* __p = _M_find_node(__n, __k, __code); local 1044 _Node* __p = _M_find_node(__n, __k, __code); local 1484 _Node* __p = __next_n; local 1635 _Node* __p = _M_begin(); local 1676 _Node* __p = _M_begin(); local [all...] |
hashtable_policy.h | 120 _Node_iterator_base(_Hash_node<_Value, __cache>* __p) 121 : _M_cur(__p) { } 160 _Node_iterator(_Hash_node<_Value, __cache>* __p) 161 : _Node_iterator_base<_Value, __cache>(__p) { } 201 _Node_const_iterator(_Hash_node<_Value, __cache>* __p) 202 : _Node_iterator_base<_Value, __cache>(__p) { } 442 typename _Hashtable::_Node* __p = __h->_M_find_node(__n, __k, __code); local 443 if (!__p) 446 return (__p->_M_v).second; 459 typename _Hashtable::_Node* __p = __h->_M_find_node(__n, __k, __code) local 477 typename _Hashtable::_Node* __p = __h->_M_find_node(__n, __k, __code); local 493 typename _Hashtable::_Node* __p = __h->_M_find_node(__n, __k, __code); local [all...] |
stl_list.h | 338 _M_put_node(_List_node<_Tp>* __p) 339 { _M_impl._Node_alloc_type::deallocate(__p, 1); } 482 _Node* __p = this->_M_get_node(); local 486 (std::__addressof(__p->_M_data), __x); 490 _M_put_node(__p); 493 return __p; 500 _Node* __p = this->_M_get_node(); 503 _M_get_Node_allocator().construct(__p, 508 _M_put_node(__p); 511 return __p; [all...] |
stl_tree.h | 322 _Rb_tree_node_base* __p, 372 _M_put_node(_Link_type __p) 373 { _M_impl._Node_allocator::deallocate(__p, 1); } 392 _M_destroy_node(_Link_type __p) 394 get_allocator().destroy(std::__addressof(__p->_M_value_field)); 395 _M_put_node(__p); 417 _M_destroy_node(_Link_type __p) 419 _M_get_Node_allocator().destroy(__p); 420 _M_put_node(__p); 600 _M_copy(_Const_Link_type __x, _Link_type __p); 1521 pair<iterator, iterator> __p = equal_range(__x); local 1569 pair<const_iterator, const_iterator> __p = equal_range(__k); local [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/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/8/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/9/sources/cxx-stl/EH/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/9/sources/cxx-stl/gnu-libstdc++/4.6/include/backward/ |
hashtable.h | 313 _M_put_node(_Node* __p) 314 { _M_node_allocator.deallocate(__p, 1); } 943 _Node* __p = __it._M_cur; local 944 if (__p) 946 const size_type __n = _M_bkt_num(__p->_M_val); 949 if (__cur == __p) 960 if (__next == __p) [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
hashtable.h | 520 _Node* __p = __array[__i]; local 521 while (__p) 523 _Node* __tmp = __p; 524 __p = __p->_M_next; 546 _Node** __p = __alloc.allocate(__n + 1); local 547 std::fill(__p, __p + __n, (_Node*) 0); 548 __p[__n] = reinterpret_cast<_Node*>(0x1000); 549 return __p; 765 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); local 782 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); local 825 _Node* __p = _M_find_node(*__head, __k, __code); local 863 _Node* __p = _M_find_node(*__head, __k, __code); local 1109 _Node* __p = *__slot; local 1124 _Node* __p = *__saved_slot; local [all...] |
shared_ptr_base.h | 288 _Sp_counted_ptr(_Ptr __p) 289 : _M_ptr(__p) { } 341 // __d(__p) must not throw. 342 _Sp_counted_deleter(_Ptr __p, _Deleter __d) 343 : _M_ptr(__p), _M_del(__d, _Alloc()) { } 345 // __d(__p) must not throw. 346 _Sp_counted_deleter(_Ptr __p, _Deleter __d, const _Alloc& __a) 347 : _M_ptr(__p), _M_del(__d, __a) { } 381 void operator()(_Tp* __p) const { if (__p) __p->~_Tp(); 399 void* __p = &_M_storage; local 409 void* __p = &_M_storage; local 991 void* __p = _M_refcount._M_get_deleter(typeid(__tag)); local [all...] |
stl_list.h | 330 _M_put_node(_List_node<_Tp>* __p) 331 { _M_impl._Node_alloc_type::deallocate(__p, 1); } 473 _Node* __p = this->_M_get_node(); local 477 (std::__addressof(__p->_M_data), __x); 481 _M_put_node(__p); 484 return __p; 491 _Node* __p = this->_M_get_node(); 494 _M_get_Node_allocator().construct(__p, 499 _M_put_node(__p); 502 return __p; [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/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...] |