| /prebuilts/ndk/9/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/9/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/9/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/9/sources/cxx-stl/gnu-libstdc++/4.8/include/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/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/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/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/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/9/sources/cxx-stl/gnu-libstdc++/4.9/include/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/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| basic_string.h | 186 void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage); local
187 return *reinterpret_cast<_Rep*>(__p);
296 _M_data(_CharT* __p) _GLIBCXX_NOEXCEPT
297 { return (_M_dataplus._M_p = __p); }
386 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
389 for (; __k1 != __k2; ++__k1, ++__p)
390 traits_type::assign(*__p, *__k1); // These types are off.
394 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2) _GLIBCXX_NOEXCEPT
395 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
398 _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2
[all...] |
| hashtable.h | 1238 __node_type* __p = _M_find_node(__n, __k, __code); local
1258 __node_type* __p = _M_find_node(__n, __k, __code); local
1278 __node_type* __p = _M_bucket_begin(__n); local
1319 __node_type* __p = _M_find_node(__n, __k, __code); local
1355 __node_type* __p = _M_find_node(__n, __k, __code); local
1814 __node_type* __p = __n->_M_next(); local
1948 __node_type* __p = _M_begin(); local
1991 __node_type* __p = _M_begin(); 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...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/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...] |
| /external/stlport/stlport/stl/ |
| _algo.c | 133 _ForwardIter2 __p = __p1;
138 while (*__current == *__p) {
139 if (++__p == __last2)
465 _RandomAccessIter __p = __first; local
469 if (__p > __first + __l) {
470 *__p = *(__p - __l);
471 __p -= __l;
474 *__p = *(__p + __k)
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 133 _ForwardIter2 __p = __p1;
138 while (*__current == *__p) {
139 if (++__p == __last2)
465 _RandomAccessIter __p = __first; local
469 if (__p > __first + __l) {
470 *__p = *(__p - __l);
471 __p -= __l;
474 *__p = *(__p + __k)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/bits/ |
| basic_string.h | 181 void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage); local
182 return *reinterpret_cast<_Rep*>(__p);
291 _M_data(_CharT* __p)
292 { return (_M_dataplus._M_p = __p); }
379 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
381 for (; __k1 != __k2; ++__k1, ++__p)
382 traits_type::assign(*__p, *__k1); // These types are off.
386 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)
387 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
390 _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2
[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);
633 _M_copy(_Const_Link_type __x, _Link_type __p);
1553 pair<iterator, iterator> __p = equal_range(__x); local
1601 pair<const_iterator, const_iterator> __p = equal_range(__k); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/ext/ |
| ropeimpl.h | 328 const _CharT* __p = __s; local
330 while (!_S_is0(*__p))
331 ++__p;
332 return (__p - __s);
870 _Rope_find_char_char_consumer(_CharT __p)
871 : _M_pattern(__p), _M_count(0) {}
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| basic_string.h | 186 void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage); local
187 return *reinterpret_cast<_Rep*>(__p);
296 _M_data(_CharT* __p)
297 { return (_M_dataplus._M_p = __p); }
384 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
386 for (; __k1 != __k2; ++__k1, ++__p)
387 traits_type::assign(*__p, *__k1); // These types are off.
391 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)
392 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
395 _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2
[all...] |
| stl_algo.h | 1600 _RandomAccessIterator __p = __first; local
4243 pair<const _Tp*, const _Tp*> __p = local
4252 pair<const _Tp*, const _Tp*> __p = local
4789 _ForwardIterator2 __p; local
[all...] |
