| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/ |
| rc_string_base.h | 186 _M_data(_CharT* __p)
187 { _M_dataplus._M_p = __p; }
438 _Rep* __p = new (__place) _Rep; local
439 __p->_M_info._M_capacity = __capacity;
440 return __p;
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
| hashtable_policy.h | 91 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
92 : _M_cur(__p) { }
133 _Node_iterator(_Hash_node<_Value, __cache>* __p)
134 : _Node_iterator_base<_Value, __cache>(__p) { }
174 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
175 : _Node_iterator_base<_Value, __cache>(__p) { }
273 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
275 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
318 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
320 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
423 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
437 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
465 const unsigned long* __p = local
527 typename _Hashtable::_Node* __p = local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| hashtable_policy.h | 102 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
103 : _M_cur(__p) { }
142 _Node_iterator(_Hash_node<_Value, __cache>* __p)
143 : _Node_iterator_base<_Value, __cache>(__p) { }
183 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
184 : _Node_iterator_base<_Value, __cache>(__p) { }
280 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
282 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
325 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
327 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
430 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
444 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
472 const unsigned long* __p = local
545 typename _Hashtable::_Node* __p = local
564 typename _Hashtable::_Node* __p = local
584 typename _Hashtable::_Node* __p = local
602 typename _Hashtable::_Node* __p = local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/ |
| rc_string_base.h | 186 _M_data(_CharT* __p)
187 { _M_dataplus._M_p = __p; }
438 _Rep* __p = new (__place) _Rep; local
439 __p->_M_info._M_capacity = __capacity;
440 return __p;
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/ |
| hashtable_policy.h | 91 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
92 : _M_cur(__p) { }
133 _Node_iterator(_Hash_node<_Value, __cache>* __p)
134 : _Node_iterator_base<_Value, __cache>(__p) { }
174 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
175 : _Node_iterator_base<_Value, __cache>(__p) { }
273 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
275 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
318 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
320 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
423 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
437 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
465 const unsigned long* __p = local
527 typename _Hashtable::_Node* __p = local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| shared_ptr_base.h | 288 _Sp_counted_ptr(_Ptr __p)
289 : _M_ptr(__p) { }
338 // __d(__p) must not throw.
339 _Sp_counted_deleter(_Ptr __p, _Deleter __d)
340 : _M_ptr(__p), _M_del(__d, _Alloc()) { }
342 // __d(__p) must not throw.
343 _Sp_counted_deleter(_Ptr __p, _Deleter __d, const _Alloc& __a)
344 : _M_ptr(__p), _M_del(__d, __a) { }
451 __shared_count(_Ptr __p) : _M_pi(0)
455 _M_pi = new _Sp_counted_ptr<_Ptr, _Lp>(__p);
1001 void* __p = _M_refcount._M_get_deleter(typeid(__tag)); local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/ |
| rc_string_base.h | 186 _M_data(_CharT* __p)
187 { _M_dataplus._M_p = __p; }
438 _Rep* __p = new (__place) _Rep; local
439 __p->_M_info._M_capacity = __capacity;
440 return __p;
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
| hashtable_policy.h | 91 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
92 : _M_cur(__p) { }
133 _Node_iterator(_Hash_node<_Value, __cache>* __p)
134 : _Node_iterator_base<_Value, __cache>(__p) { }
174 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
175 : _Node_iterator_base<_Value, __cache>(__p) { }
273 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
275 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
318 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
320 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
423 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
437 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
465 const unsigned long* __p = local
527 typename _Hashtable::_Node* __p = local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| shared_ptr_base.h | 285 _Sp_counted_ptr(_Ptr __p)
286 : _M_ptr(__p) { }
335 // __d(__p) must not throw.
336 _Sp_counted_deleter(_Ptr __p, _Deleter __d)
337 : _M_ptr(__p), _M_del(__d, _Alloc()) { }
339 // __d(__p) must not throw.
340 _Sp_counted_deleter(_Ptr __p, _Deleter __d, const _Alloc& __a)
341 : _M_ptr(__p), _M_del(__d, __a) { }
448 __shared_count(_Ptr __p) : _M_pi(0)
452 _M_pi = new _Sp_counted_ptr<_Ptr, _Lp>(__p);
961 void* __p = _M_refcount._M_get_deleter(typeid(__tag)); local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/ |
| rc_string_base.h | 185 _M_data(_CharT* __p)
186 { _M_dataplus._M_p = __p; }
437 _Rep* __p = new (__place) _Rep; local
438 __p->_M_info._M_capacity = __capacity;
439 return __p;
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/tr1/ |
| hashtable_policy.h | 91 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
92 : _M_cur(__p) { }
133 _Node_iterator(_Hash_node<_Value, __cache>* __p)
134 : _Node_iterator_base<_Value, __cache>(__p) { }
174 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
175 : _Node_iterator_base<_Value, __cache>(__p) { }
273 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
275 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
318 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
320 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
423 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
437 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
465 const unsigned long* __p = local
527 typename _Hashtable::_Node* __p = local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| shared_ptr_base.h | 368 _Sp_counted_ptr(_Ptr __p) noexcept
369 : _M_ptr(__p) { }
440 _Impl(_Ptr __p, _Deleter __d, const _Alloc& __a) noexcept
441 : _M_ptr(__p), _Del_base(__d), _Alloc_base(__a)
451 // __d(__p) must not throw.
452 _Sp_counted_deleter(_Ptr __p, _Deleter __d) noexcept
453 : _M_impl(__p, __d, _Alloc()) { }
455 // __d(__p) must not throw.
456 _Sp_counted_deleter(_Ptr __p, _Deleter __d, const _Alloc& __a) noexcept
457 : _M_impl(__p, __d, __a) {
1094 void* __p = _M_refcount._M_get_deleter(typeid(__tag)); local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/ |
| rc_string_base.h | 185 _M_data(_CharT* __p)
186 { _M_dataplus._M_p = __p; }
437 _Rep* __p = new (__place) _Rep; local
438 __p->_M_info._M_capacity = __capacity;
439 return __p;
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/ |
| hashtable_policy.h | 91 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
92 : _M_cur(__p) { }
133 _Node_iterator(_Hash_node<_Value, __cache>* __p)
134 : _Node_iterator_base<_Value, __cache>(__p) { }
174 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
175 : _Node_iterator_base<_Value, __cache>(__p) { }
273 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
275 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
318 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
320 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
423 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
437 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
465 const unsigned long* __p = local
527 typename _Hashtable::_Node* __p = local
[all...] |
| /external/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...] |
| /ndk/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/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/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/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/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/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/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-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/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-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| forward_list.h | 370 _M_put_node(_Node* __p)
371 { _Node_alloc_traits::deallocate(_M_get_Node_allocator(), __p, 1); } local
[all...] |
