Home
last modified time | relevance | path

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

12

/external/kernel-headers/original/asm-arm/
Dunaligned.h42 #define __get_unaligned_2_le(__p) \ argument
43 (__p[0] | __p[1] << 8)
45 #define __get_unaligned_2_be(__p) \ argument
46 (__p[0] << 8 | __p[1])
48 #define __get_unaligned_4_le(__p) \ argument
49 (__p[0] | __p[1] << 8 | __p[2] << 16 | __p[3] << 24)
51 #define __get_unaligned_4_be(__p) \ argument
52 (__p[0] << 24 | __p[1] << 16 | __p[2] << 8 | __p[3])
57 __u8 *__p = (__u8 *)(ptr); \
60 case 2: __v = __get_unaligned_2_le(__p); break; \
[all …]
Duaccess.h102 #define __get_user_x(__r2,__p,__e,__s,__i...) \ argument
107 : "0" (__p) \
112 const register typeof(*(p)) __user *__p asm("r0") = (p);\
115 switch (sizeof(*(__p))) { \
117 __get_user_x(__r2, __p, __e, 1, "lr"); \
120 __get_user_x(__r2, __p, __e, 2, "r3", "lr"); \
123 __get_user_x(__r2, __p, __e, 4, "lr"); \
136 #define __put_user_x(__r2,__p,__e,__s) \ argument
141 : "0" (__p), "r" (__r2) \
147 const register typeof(*(p)) __user *__p asm("r0") = (p);\
[all …]
/external/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_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_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_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_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_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 …]
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_list.h285 _Node* __p = this->_M_node.allocate(1);
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);
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;
429 __tmp->_M_prev = __p;
[all …]
D_iostream_string.h69 void deallocate(pointer __p, size_type __n) { in deallocate() argument
70 if (__p != _M_static_buf) _Base::deallocate(__p, __n); in deallocate()
/external/tcpdump/
Dcpack.h46 #define cpack_int8(__s, __p) cpack_uint8((__s), (u_int8_t*)(__p)) argument
47 #define cpack_int16(__s, __p) cpack_uint16((__s), (u_int16_t*)(__p)) argument
48 #define cpack_int32(__s, __p) cpack_uint32((__s), (u_int32_t*)(__p)) argument
49 #define cpack_int64(__s, __p) cpack_uint64((__s), (u_int64_t*)(__p)) argument
/external/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 …]
/external/stlport/test/eh/
DPrefix.h149 void deallocate(pointer __p, size_type __n) const { in deallocate() argument
150 _STLP_ASSERT( (__p == 0) == (__n == 0) ) in deallocate()
151 if (__p != 0) EH_STD::__new_alloc::deallocate((void*)__p, __n * sizeof(value_type)); in deallocate()
154 …void deallocate(pointer __p) const { if (__p != 0) EH_STD::__new_alloc::deallocate((void*)__p, si… in deallocate() argument
156 void construct(pointer __p, const _Tp& __val) const { stlport::construct(__p, __val); } in construct() argument
157 void destroy(pointer __p) const { stlport::destroy(__p); } in destroy() argument
/external/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 …]
D_string.h426 iterator insert(iterator __p, _CharT __c) { in insert() argument
427 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__p)) in insert()
429 typename _Base::iterator __ret = _M_non_dbg_impl.insert(__p._M_iterator, __c); in insert()
434 void insert(iterator __p, size_t __n, _CharT __c) { in insert() argument
435 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__p)) in insert()
437 _M_non_dbg_impl.insert(__p._M_iterator, __n, __c); in insert()
443 void insert(iterator __p, _InputIter __first, _InputIter __last) { in insert() argument
444 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__p)) in insert()
448 _M_non_dbg_impl.insert(__p._M_iterator, in insert()
455 void insert(iterator __p, const _CharT* __f, const _CharT* __l) { in insert() argument
[all …]
D_hashtable.h285 pair<iterator, iterator> __p = equal_range(__key); in erase() local
286 size_type __n = _STLP_STD::distance(__p.first, __p.second); in erase()
287 _Invalidate_iterators(__p.first, __p.second); in erase()
288 _M_non_dbg_impl.erase(__p.first._M_iterator, __p.second._M_iterator); in erase()
/external/clang/test/CodeGenCXX/
DDynArrayInit.cpp7 inline void* operator new[](unsigned long, void* __p) { return __p; } in operator new[]() argument
/external/bluetooth/bluez/lib/bluetooth/
Dbluetooth.h117 } *__p = (void *) (ptr); \
118 __p->__v; \
125 } *__p = (void *) (ptr); \
126 __p->__v = (val); \
/external/kernel-headers/original/linux/
Dpercpu.h31 struct percpu_data *__p = (struct percpu_data *)~(unsigned long)(ptr); \
32 (__typeof__(ptr))__p->ptrs[(cpu)]; \
/external/stlport/test/unit/
Dstack_allocator.h138 void construct(pointer __p, const_reference __val) { new(__p) _Tp(__val); } in construct()
139 void destroy(pointer __p) { __p->~_Tp(); } in destroy()

12