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 __attribute__((always_inline)) inline void _Copy_Construct_aux(_Tp* __p, const _Tp& __val, const __… 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++/libcxx/include/
Dlist248 explicit __list_iterator(__node_pointer __p, const void* __c) _NOEXCEPT
249 : __ptr_(__p)
255 explicit __list_iterator(__node_pointer __p) _NOEXCEPT : __ptr_(__p) {}
287 __list_iterator(const __list_iterator& __p)
288 : __ptr_(__p.__ptr_)
290 __get_db()->__iterator_copy(this, &__p);
300 __list_iterator& operator=(const __list_iterator& __p)
302 if (this != &__p)
304 __get_db()->__iterator_copy(this, &__p);
305 __ptr_ = __p.__ptr_;
[all …]
Dsstream263 char_type* __p = const_cast<char_type*>(__rhs.__str_.data());
269 __binp = __rhs.eback() - __p;
270 __ninp = __rhs.gptr() - __p;
271 __einp = __rhs.egptr() - __p;
278 __bout = __rhs.pbase() - __p;
279 __nout = __rhs.pptr() - __p;
280 __eout = __rhs.epptr() - __p;
282 ptrdiff_t __hm = __rhs.__hm_ == nullptr ? -1 : __rhs.__hm_ - __p;
284 __p = const_cast<char_type*>(__str_.data());
286 this->setg(__p + __binp, __p + __ninp, __p + __einp);
[all …]
Dutility267 pair(const pair<_U1, _U2>& __p
273 : first(__p.first), second(__p.second) {}
277 pair(const pair& __p) = default;
280 pair(const pair& __p)
283 : first(__p.first),
284 second(__p.second)
290 pair& operator=(const pair& __p)
294 first = __p.first;
295 second = __p.second;
312 pair(pair<_U1, _U2>&& __p,
[all …]
Dforward_list232 explicit __forward_list_iterator(__node_pointer __p) _NOEXCEPT : __ptr_(__p) {}
292 explicit __forward_list_const_iterator(__node_const_pointer __p) _NOEXCEPT
293 : __ptr_(__p) {}
326 __forward_list_const_iterator(__forward_list_iterator<__node_pointer> __p) _NOEXCEPT
327 : __ptr_(__p.__ptr_) {}
540 for (__node_pointer __p = __before_begin()->__next_; __p != nullptr;)
542 __node_pointer __next = __p->__next_;
543 __node_traits::destroy(__a, _VSTD::addressof(__p->__value_));
544 __node_traits::deallocate(__a, __p, 1);
545 __p = __next;
[all …]
Dmemory1041 __to_raw_pointer(_Tp* __p) _NOEXCEPT
1043 return __p;
1049 __to_raw_pointer(_Pointer __p) _NOEXCEPT
1051 return _VSTD::__to_raw_pointer(__p.operator->());
1243 __has_allocate_hint_test(_Alloc&& __a, _SizeType&& __sz, _ConstVoidPtr&& __p)
1244 -> decltype(__a.allocate(__sz, __p), true_type());
1248 __has_allocate_hint_test(const _Alloc& __a, _SizeType&& __sz, _ConstVoidPtr&& __p)
1278 __has_construct_test(_Alloc&& __a, _Tp* __p, _Args&& ...__args);
1282 __has_construct_test(const _Alloc& __a, _Pointer&& __p, _Args&& ...__args);
1297 __has_destroy_test(_Alloc&& __a, _Pointer&& __p)
[all …]
Dthread135 void reset(pointer __p = nullptr);
140 __thread_specific_ptr<_Tp>::__at_thread_exit(void* __p)
142 delete static_cast<pointer>(__p);
166 pointer __p = get();
168 return __p;
173 __thread_specific_ptr<_Tp>::reset(pointer __p)
176 pthread_setspecific(__key_, __p);
342 std::unique_ptr<_Fp> __p(static_cast<_Fp*>(__vp));
344 __thread_execute(*__p, _Index());
354 _VSTD::unique_ptr<_Gp> __p(new _Gp(__decay_copy(_VSTD::forward<_Fp>(__f)),
[all …]
Dnew133 _LIBCPP_NEW_DELETE_VIS void operator delete(void* __p) _NOEXCEPT;
134 _LIBCPP_NEW_DELETE_VIS void operator delete(void* __p, const std::nothrow_t&) _NOEXCEPT;
142 _LIBCPP_NEW_DELETE_VIS void operator delete[](void* __p) _NOEXCEPT;
143 _LIBCPP_NEW_DELETE_VIS void operator delete[](void* __p, const std::nothrow_t&) _NOEXCEPT;
145 inline _LIBCPP_INLINE_VISIBILITY void* operator new (std::size_t, void* __p) _NOEXCEPT {return __p…
146 inline _LIBCPP_INLINE_VISIBILITY void* operator new[](std::size_t, void* __p) _NOEXCEPT {return __p…
Dstring996 __find(const _CharT *__p, _SizeT __sz,
1001 const _CharT* __r = _Traits::find(__p + __pos, __sz - __pos, __c);
1004 return static_cast<_SizeT>(__r - __p);
1009 __find(const _CharT *__p, _SizeT __sz,
1017 // return _VSTD::__find<_CharT, _SizeT, _Traits, __npos>(__p, __sz, *__s, __pos);
1019 _VSTD::search(__p + __pos, __p + __sz, __s, __s + __n, _Traits::eq);
1020 if (__r == __p + __sz)
1022 return static_cast<_SizeT>(__r - __p);
1030 __rfind(const _CharT *__p, _SizeT __sz,
1039 for (const _CharT* __ps = __p + __pos; __ps != __p;)
[all …]
Dvector795 iterator __make_iter(pointer __p) _NOEXCEPT;
797 const_iterator __make_iter(const_pointer __p) const _NOEXCEPT;
799 … pointer __swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v, pointer __p);
809 for (__i_node** __p = __c->end_; __p != __c->beg_; )
811 --__p;
812 const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
815 (*__p)->__c_ = nullptr;
816 if (--__c->end_ != __p)
817 memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
889 …locator>::__swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v, pointer __p)
[all …]
/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/sources/cxx-stl/llvm-libc++/libcxx/src/
Dfuture.cpp116 __assoc_sub_state::set_exception(exception_ptr __p) in set_exception() argument
123 __exception_ = __p; in set_exception()
130 __assoc_sub_state::set_exception_at_thread_exit(exception_ptr __p) in set_exception_at_thread_exit() argument
137 __exception_ = __p; in set_exception_at_thread_exit()
256 promise<void>::set_exception(exception_ptr __p) in set_exception() argument
262 __state_->set_exception(__p); in set_exception()
276 promise<void>::set_exception_at_thread_exit(exception_ptr __p) in set_exception_at_thread_exit() argument
282 __state_->set_exception_at_thread_exit(__p); in set_exception_at_thread_exit()
/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
/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

1234