Home
last modified time | relevance | path

Searched refs:__p (Results 1 – 25 of 80) sorted by relevance

1234

/ndk/sources/cxx-stl/stlport/stlport/stl/
D_construct.h90 inline void _Construct_aux (_T1* __p, const __false_type&) { in _Construct_aux() argument
91 new(__p) _T1(); in _Construct_aux()
95 inline void _Construct_aux (_T1* __p, const __true_type&) { in _Construct_aux() argument
97 *__p = _T1(0); in _Construct_aux()
101 *__p = _T1(); in _Construct_aux()
106 inline void _Construct(_T1* __p) { in _Construct() argument
108 memset((char*)__p, _STLP_SHRED_BYTE, sizeof(_T1)); in _Construct()
111 _Construct_aux (__p, _HasDefaultZeroValue(__p)._Answer()); in _Construct()
113 _Construct_aux (__p, _Is_POD(__p)._Answer()); in _Construct()
118 inline void _Copy_Construct_aux(_Tp* __p, const _Tp& __val, const __false_type&) { in _Copy_Construct_aux() argument
[all …]
D_threads.h71 # define _STLP_ATOMIC_EXCHANGE(__p, __q) test_and_set(__p, __q) argument
73 # define _STLP_ATOMIC_EXCHANGE(__p, __q) __test_and_set((unsigned long*)__p, (unsigned long)__… argument
507 static __stl_atomic_t _S_swap(_STLP_VOLATILE __stl_atomic_t* __p, __stl_atomic_t __q) { in _S_swap() argument
510 return _STLP_ATOMIC_EXCHANGE(__p, __q); in _S_swap()
513 __stl_atomic_t __result = *__p; in _S_swap()
514 *__p = __q; in _S_swap()
522 __stl_atomic_t __result = *__p; in _S_swap()
523 *__p = __q; in _S_swap()
528 static void* _S_swap_ptr(void* _STLP_VOLATILE* __p, void* __q) { in _S_swap_ptr() argument
531 return _STLP_ATOMIC_EXCHANGE_PTR(__p, __q); in _S_swap_ptr()
[all …]
D_rope.h140 inline void _S_construct_null_aux(_CharT *__p, const __true_type&)
141 { *__p = 0; }
144 inline void _S_construct_null_aux(_CharT *__p, const __false_type&)
145 { _STLP_STD::_Construct(__p); }
148 inline void _S_construct_null(_CharT *__p) {
150 _S_construct_null_aux(__p, _Char_Is_Integral());
634 _Rope_self_destruct_ptr(_Rope_RopeRep<_CharT,_Alloc>* __p) : _M_ptr(__p) {}
664 _Rope_char_ref_proxy(_My_rope* __r, size_t __p) :
665 _M_pos(__p), _M_current_valid(false), _M_root(__r) {}
672 _Rope_char_ref_proxy(_My_rope* __r, size_t __p, _CharT __c)
[all …]
D_alloc.h80 static void _STLP_CALL deallocate(void* __p, size_t /* __n */) { free((char*)__p); } in deallocate() argument
93 static void _STLP_CALL deallocate(void* __p, size_t) { __stl_delete(__p); } in deallocate() argument
151 static void _STLP_CALL _M_deallocate(void *__p, size_t __n);
160 static void _STLP_CALL deallocate(void *__p, size_t __n) in deallocate() argument
161 { if (__n > (size_t)_MAX_BYTES) __stl_delete(__p); else _M_deallocate(__p, __n); } in deallocate()
317 void deallocate(pointer __p, size_type __n) { in deallocate() argument
318 _STLP_ASSERT( (__p == 0) == (__n == 0) ) in deallocate()
319 if (__p != 0) { in deallocate()
321 memset((char*)__p, _STLP_SHRED_BYTE, __n * sizeof(value_type)); in deallocate()
323 __sgi_alloc::deallocate((void*)__p, __n * sizeof(value_type)); in deallocate()
[all …]
D_alloc.c55 __debug_alloc<_Alloc>::deallocate(void *__p, size_t __n) { in deallocate() argument
56 __alloc_header * __real_p = (__alloc_header*)((char *)__p -(long)__extra_before); in deallocate()
64 for (__tmp = (unsigned char*)(__real_p + 1); __tmp < (unsigned char*)__p; ++__tmp) { in deallocate()
70 for (__tmp= ((unsigned char*)__p) + __n * sizeof(value_type); in deallocate()
77 memset((char*)__p, __shred_byte, __n * sizeof(value_type)); in deallocate()
D_pthread_alloc.h79 static void _STLP_CALL deallocate(void *__p, size_t __n);
86 static void _STLP_CALL deallocate(void *__p, size_t __n, __state_type* __a);
88 static void * _STLP_CALL reallocate(void *__p, size_t __old_sz, size_t& __new_sz);
145 void deallocate(pointer __p, size_type __n) { in deallocate() argument
146 _STLP_ASSERT( (__p == 0) == (__n == 0) ) in deallocate()
147 if (__p != 0) { in deallocate()
149 memset((char*)__p, _STLP_SHRED_BYTE, __n * sizeof(value_type)); in deallocate()
151 _S_Alloc::deallocate(__p, __n * sizeof(value_type)); in deallocate()
158 void construct(pointer __p, const _Tp& __val) { new(__p) _Tp(__val); } in construct() argument
328 void deallocate(pointer __p, size_type __n) {
[all …]
D_function_adaptors.h71 _Result operator ()(_Tp* __p) const { return (__p->*_M_f)(); } in operator()
84 _Result operator ()(_Tp* __p, _Arg __x) const { return (__p->*_M_f)(__x); } in operator()
97 _Result operator ()(const _Tp* __p) const { return (__p->*_M_f)(); } in operator()
110 _Result operator ()(const _Tp* __p, _Arg __x) const { in operator()
111 return (__p->*_M_f)(__x); } in operator()
124 _Result operator ()(_Tp& __p) const { return (__p.*_M_f)(); } in operator()
137 _Result operator ()(_Tp& __p, _Arg __x) const { return (__p.*_M_f)(__x); } in operator()
150 _Result operator ()(const _Tp& __p) const { return (__p.*_M_f)(); } in operator()
163 _Result operator ()(const _Tp& __p, _Arg __x) const { return (__p.*_M_f)(__x); } in operator()
233 void operator ()(_Tp* __p) const { (__p->*_M_f)(); } in operator()
[all …]
D_tree.h377 _Base_ptr _M_copy(_Base_ptr __x, _Base_ptr __p);
503 pair<iterator,iterator> __p = equal_range(__x);
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);
598 return _STLP_STD::distance(__p.first, __p.second);
616 pair<iterator, iterator> __p;
617 __p.second = lower_bound(__x);
618 if (__p.second._M_node != &this->_M_header._M_data &&
619 !_M_key_compare(__x, _S_key(__p.second._M_node))) {
[all …]
D_new.h132 inline void _STLP_CALL __stl_delete(void* __p) { ::operator delete(__p, __FILE__, __LINE__); } in __stl_delete() argument
135 inline void _STLP_CALL __stl_delete(void* __p) { ::operator delete(__p); }
D_istreambuf_iterator.h62 istreambuf_iterator(streambuf_type* __p = 0) { this->_M_init(__p); }
83 void _M_init(streambuf_type* __p) { in _M_init() argument
84 _M_buf = __p; in _M_init()
85 _M_eof = (__p == 0); in _M_init()
D_string_workaround.h346 iterator insert(iterator __p, _CharT __c) in insert() argument
347 { return _Base::insert(__p, __c); } in insert()
349 void insert(iterator __p, size_t __n, _CharT __c) in insert() argument
350 { _Base::insert(__p, __n, __c); } in insert()
355 void insert(iterator __p, _InputIter __first, _InputIter __last) { in insert() argument
357 _M_insert_dispatch(__p, __first, __last, _Integral()); in insert()
362 void insert(iterator __p, const _CharT* __f, const _CharT* __l) { in insert() argument
364 _M_insert(__p, __f, __l, this->_M_inside(__f)); in insert()
369 void _M_insert(iterator __p, const _CharT* __f, const _CharT* __l, bool __self_ref) { in _M_insert() argument
371 _Base::_M_insert(__p, __f, __l, __self_ref); in _M_insert()
[all …]
/ndk/sources/cxx-stl/stlport/src/
Dallocators.cpp64 inline void __stlp_delete_chunck(void* __p) { ::operator delete(__p, __FILE__, __LINE__); } in __stlp_delete_chunck() argument
76 inline void __stlp_delete_chunck(void* __p) { _STLP_VENDOR_CSTD::free(__p); } in __stlp_delete_chunck() argument
80 inline void __stlp_delete_chunck(void* __p) { _STLP_STD::__stl_delete(__p); } in __stlp_delete_chunck() argument
314 static void _M_deallocate(void *__p, size_t __n);
340 void __node_alloc_impl::_M_deallocate(void *__p, size_t __n) { in _M_deallocate() argument
342 _Obj * __pobj = __STATIC_CAST(_Obj*, __p); in _M_deallocate()
400 _Obj* __p; in _S_chunk_alloc() local
406 __p = *__my_free_list; in _S_chunk_alloc()
407 if (0 != __p) { in _S_chunk_alloc()
408 *__my_free_list = __p -> _M_next; in _S_chunk_alloc()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/include/
Dlist234 explicit __list_iterator(__node_pointer __p, const void* __c) _NOEXCEPT
235 : __ptr_(__p)
241 explicit __list_iterator(__node_pointer __p) _NOEXCEPT : __ptr_(__p) {}
273 __list_iterator(const __list_iterator& __p)
274 : __ptr_(__p.__ptr_)
276 __get_db()->__iterator_copy(this, &__p);
286 __list_iterator& operator=(const __list_iterator& __p)
288 if (this != &__p)
290 __get_db()->__iterator_copy(this, &__p);
291 __ptr_ = __p.__ptr_;
[all …]
Dutility234 pair(const pair<_U1, _U2>& __p
240 : first(__p.first), second(__p.second) {}
243 pair(const pair& __p)
246 : first(__p.first),
247 second(__p.second)
252 pair& operator=(const pair& __p)
256 first = __p.first;
257 second = __p.second;
274 pair(pair<_U1, _U2>&& __p,
277 : first(_VSTD::forward<_U1>(__p.first)),
[all …]
Dforward_list226 explicit __forward_list_iterator(__node_pointer __p) _NOEXCEPT : __ptr_(__p) {}
286 explicit __forward_list_const_iterator(__node_const_pointer __p) _NOEXCEPT
287 : __ptr_(__p) {}
320 __forward_list_const_iterator(__forward_list_iterator<__node_pointer> __p) _NOEXCEPT
321 : __ptr_(__p.__ptr_) {}
525 for (__node_pointer __p = __before_begin()->__next_; __p != nullptr;)
527 __node_pointer __next = __p->__next_;
528 __node_traits::destroy(__a, _VSTD::addressof(__p->__value_));
529 __node_traits::deallocate(__a, __p, 1);
530 __p = __next;
[all …]
Dsstream269 char_type* __p = const_cast<char_type*>(__str_.data());
270 this->setg(__p, __p + __ninp, __p + __einp);
271 this->setp(__p, __p + __eout);
273 __hm_ = __p + __hm;
274 __p = const_cast<char_type*>(__rhs.__str_.data());
275 __rhs.setg(__p, __p, __p);
276 __rhs.setp(__p, __p);
277 __rhs.__hm_ = __p;
292 char_type* __p = const_cast<char_type*>(__str_.data());
293 this->setg(__p, __p + __ninp, __p + __einp);
[all …]
Dmemory1081 __to_raw_pointer(_Tp* __p) _NOEXCEPT
1083 return __p;
1089 __to_raw_pointer(_Pointer __p) _NOEXCEPT
1091 return _VSTD::__to_raw_pointer(__p.operator->());
1283 __has_allocate_hint_test(_Alloc&& __a, _SizeType&& __sz, _ConstVoidPtr&& __p)
1284 -> decltype(__a.allocate(__sz, __p), true_type());
1288 __has_allocate_hint_test(const _Alloc& __a, _SizeType&& __sz, _ConstVoidPtr&& __p)
1318 __has_construct_test(_Alloc&& __a, _Tp* __p, _Args&& ...__args);
1322 __has_construct_test(const _Alloc& __a, _Pointer&& __p, _Args&& ...__args);
1337 __has_destroy_test(_Alloc&& __a, _Pointer&& __p)
[all …]
Dnew100 _LIBCPP_VISIBLE void operator delete(void* __p) _NOEXCEPT;
101 _LIBCPP_VISIBLE void operator delete(void* __p, const std::nothrow_t&) _NOEXCEPT;
109 _LIBCPP_VISIBLE void operator delete[](void* __p) _NOEXCEPT;
110 _LIBCPP_VISIBLE void operator delete[](void* __p, const std::nothrow_t&) _NOEXCEPT;
112 _LIBCPP_INLINE_VISIBILITY inline void* operator new (std::size_t, void* __p) _NOEXCEPT {return __p…
113 _LIBCPP_INLINE_VISIBILITY inline void* operator new[](std::size_t, void* __p) _NOEXCEPT {return __p…
Dstring1509 void __set_long_pointer(pointer __p) _NOEXCEPT
1510 {__r_.first().__l.__data_ = __p;}
1684 for (iterator* __p = __iterator_list_.first; __p;)
1686 if (*__p - __beg > static_cast<difference_type>(__pos))
1688 iterator* __n = __p;
1689 __p = __p->__next;
1693 __p = __p->__next;
1698 for (const_iterator* __p = __iterator_list_.second; __p;)
1700 if (*__p - __beg > static_cast<difference_type>(__pos))
1702 const_iterator* __n = __p;
[all …]
Dthread133 void reset(pointer __p = nullptr);
138 __thread_specific_ptr<_Tp>::__at_thread_exit(void* __p)
140 delete static_cast<pointer>(__p);
162 pointer __p = get();
164 return __p;
169 __thread_specific_ptr<_Tp>::reset(pointer __p)
172 pthread_setspecific(__key_, __p);
339 std::unique_ptr<_Fp> __p(static_cast<_Fp*>(__vp));
341 __threaad_execute(*__p, _Index());
351 _VSTD::unique_ptr<_Gp> __p(new _Gp(__decay_copy(_VSTD::forward<_Fp>(__f)),
[all …]
Dvector763 iterator __make_iter(pointer __p) _NOEXCEPT;
765 const_iterator __make_iter(const_pointer __p) const _NOEXCEPT;
767 … pointer __swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v, pointer __p);
777 for (__i_node** __p = __c->end_; __p != __c->beg_; )
779 --__p;
780 const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
783 (*__p)->__c_ = nullptr;
784 if (--__c->end_ != __p)
785 memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
820 …locator>::__swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v, pointer __p)
[all …]
/ndk/sources/cxx-stl/llvm-libc++/src/
Dfuture.cpp99 __assoc_sub_state::set_exception(exception_ptr __p) in set_exception() argument
106 __exception_ = __p; in set_exception()
113 __assoc_sub_state::set_exception_at_thread_exit(exception_ptr __p) in set_exception_at_thread_exit() argument
120 __exception_ = __p; in set_exception_at_thread_exit()
239 promise<void>::set_exception(exception_ptr __p) in set_exception() argument
245 __state_->set_exception(__p); in set_exception()
259 promise<void>::set_exception_at_thread_exit(exception_ptr __p) in set_exception_at_thread_exit() argument
265 __state_->set_exception_at_thread_exit(__p); in set_exception_at_thread_exit()
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/
D_tree.h211 _STLP_STD::pair<_Base_iterator, _Base_iterator> __p; in equal_range_unique() local
212 __p = _M_non_dbg_impl.equal_range_unique(__x); in equal_range_unique()
213 …return pair<iterator, iterator>(iterator(&_M_iter_list, __p.first), iterator(&_M_iter_list, __p.se… in equal_range_unique()
217 _STLP_STD::pair<_Base_const_iterator, _Base_const_iterator> __p; in equal_range_unique() local
218 __p = _M_non_dbg_impl.equal_range_unique(__x); in equal_range_unique()
219 return pair<const_iterator, const_iterator>(const_iterator(&_M_iter_list, __p.first), in equal_range_unique()
220 const_iterator(&_M_iter_list, __p.second)); in equal_range_unique()
276 pair<iterator, iterator> __p = equal_range(__x); in erase() local
277 size_type __n = _STLP_STD::distance(__p.first._M_iterator, __p.second._M_iterator); in erase()
278 _Invalidate_iterators(__p.first, __p.second); in erase()
[all …]
/ndk/tests/device/test-stlport_shared-exception/jni/
Dnew16.cpp10 inline void* operator new(size_t, void* __p) throw() { return __p; } in operator new() argument
/ndk/tests/device/test-stlport_static-exception/jni/
Dnew16.cpp10 inline void* operator new(size_t, void* __p) throw() { return __p; } in operator new() argument

1234