Searched refs:__p (Results 1 - 22 of 22) sorted by relevance

/haiku/headers/cpp/std/
H A Dvalarray_array.h168 _Array<_Tp>::_Array (_Tp* const __restrict__ __p) : _M_data (__p) {} argument
193 for (_Tp* __p=__a._M_data; __p<__a._M_data+__n; ++__p) \
194 *__p _Op##= __t; \
201 _Tp* __p (__a._M_data); \
202 for (_Tp* __q=__b._M_data; __q<__b._M_data+__n; ++__p, ++__q) \
203 *__p _Op##= *__q; \
211 _Tp* __p (__
[all...]
/haiku/headers/cpp/
H A Dmemory36 explicit auto_ptr(_Tp* __p = 0) __STL_NOTHROW : _M_ptr(__p) {}
71 void reset(_Tp* __p = 0) __STL_NOTHROW {
73 _M_ptr = __p;
86 auto_ptr_ref(_Tp1* __p) : _M_ptr(__p) {}
H A Dstl_construct.h47 inline void construct(_T1* __p, const _T2& __value) { argument
48 new (__p) _T1(__value);
52 inline void construct(_T1* __p) { argument
53 new (__p) _T1();
H A Dstl_rope.h298 void __name##_deallocate(_Tp* __p, size_t __n) \
299 { __name##Allocator(_M_data_allocator).deallocate(__p, __n); }
325 void __name##_deallocate(_Tp *__p, size_t __n) \
326 { __name##Alloc::deallocate(__p, __n); }
362 static void __name##_deallocate(_Tp* __p, size_t __n) \
363 { __name##Alloc::deallocate(__p, __n); }
737 _Rope_self_destruct_ptr(_Rope_RopeRep<_CharT,_Alloc>* __p) : _M_ptr(__p) {} argument
768 _Rope_char_ref_proxy(_My_rope* __r, size_t __p) : argument
769 _M_pos(__p), _M_current_vali
776 _Rope_char_ref_proxy(_My_rope* __r, size_t __p, _CharT __c) argument
1291 _S_atomic_swap(_Cstrptr* __p, _Cstrptr __q) argument
1301 _S_atomic_swap(_Cstrptr* __p, _Cstrptr __q) argument
1310 _S_atomic_swap(_Cstrptr* __p, _Cstrptr __q) argument
1318 _S_atomic_swap(_Cstrptr* __p, _Cstrptr __q) argument
1974 insert(size_t __p, const rope& __r) argument
1984 insert(size_t __p, size_t __n, _CharT __c) argument
1989 insert(size_t __p, const _CharT* __i, size_t __n) argument
1999 insert(size_t __p, const _CharT* __c_string) argument
2003 insert(size_t __p, _CharT __c) argument
2007 insert(size_t __p) argument
2012 insert(size_t __p, const _CharT* __i, const _CharT* __j) argument
2017 insert(size_t __p, const const_iterator& __i, const const_iterator& __j) argument
2023 insert(size_t __p, const iterator& __i, const iterator& __j) argument
2031 replace(size_t __p, size_t __n, const rope& __r) argument
2038 replace(size_t __p, size_t __n, const _CharT* __i, size_t __i_len) argument
2044 replace(size_t __p, size_t __n, _CharT __c) argument
2049 replace(size_t __p, size_t __n, const _CharT* __c_string) argument
2054 replace(size_t __p, size_t __n, const _CharT* __i, const _CharT* __j) argument
2060 replace(size_t __p, size_t __n, const const_iterator& __i, const const_iterator& __j) argument
2066 replace(size_t __p, size_t __n, const iterator& __i, const iterator& __j) argument
2073 replace(size_t __p, _CharT __c) argument
2078 replace(size_t __p, const rope& __r) argument
2082 replace(size_t __p, const _CharT* __i, size_t __i_len) argument
2086 replace(size_t __p, const _CharT* __c_string) argument
2090 replace(size_t __p, const _CharT* __i, const _CharT* __j) argument
2094 replace(size_t __p, const const_iterator& __i, const const_iterator& __j) argument
2099 replace(size_t __p, const iterator& __i, const iterator& __j) argument
2105 erase(size_t __p, size_t __n) argument
2112 erase(size_t __p) argument
2117 insert(const iterator& __p, const rope& __r) argument
2119 insert(const iterator& __p, size_t __n, _CharT __c) argument
2121 insert(const iterator& __p, _CharT __c) argument
2125 insert(const iterator& __p, const _CharT* c_string) argument
2127 insert(const iterator& __p, const _CharT* __i, size_t __n) argument
2129 insert(const iterator& __p, const _CharT* __i, const _CharT* __j) argument
2132 insert(const iterator& __p, const const_iterator& __i, const const_iterator& __j) argument
2135 insert(const iterator& __p, const iterator& __i, const iterator& __j) argument
2140 replace(const iterator& __p, const iterator& __q, const rope& __r) argument
2143 replace(const iterator& __p, const iterator& __q, _CharT __c) argument
2145 replace(const iterator& __p, const iterator& __q, const _CharT* __c_string) argument
2148 replace(const iterator& __p, const iterator& __q, const _CharT* __i, size_t __n) argument
2151 replace(const iterator& __p, const iterator& __q, const _CharT* __i, const _CharT* __j) argument
2154 replace(const iterator& __p, const iterator& __q, const const_iterator& __i, const const_iterator& __j) argument
2157 replace(const iterator& __p, const iterator& __q, const iterator& __i, const iterator& __j) argument
2162 replace(const iterator& __p, const rope& __r) argument
2164 replace(const iterator& __p, _CharT __c) argument
2166 replace(const iterator& __p, const _CharT* __c_string) argument
2168 replace(const iterator& __p, const _CharT* __i, size_t __n) argument
2170 replace(const iterator& __p, const _CharT* __i, const _CharT* __j) argument
2172 replace(const iterator& __p, const_iterator __i, const_iterator __j) argument
2175 replace(const iterator& __p, iterator __i, iterator __j) argument
2179 erase(const iterator& __p, const iterator& __q) argument
2184 erase(const iterator& __p) argument
[all...]
H A Dstl_pair.h48 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {} argument
H A Dstl_alloc.h166 static void deallocate(void* __p, size_t /* __n */) argument
168 free(__p);
171 static void* reallocate(void* __p, size_t /* old_sz */, size_t __new_sz) argument
173 void* __result = realloc(__p, __new_sz);
174 if (0 == __result) __result = _S_oom_realloc(__p, __new_sz);
211 void* __malloc_alloc_template<__inst>::_S_oom_realloc(void* __p, size_t __n) argument
220 __result = realloc(__p, __n);
235 static void deallocate(_Tp* __p, size_t __n) argument
236 { if (0 != __n) _Alloc::deallocate(__p, __n * sizeof (_Tp)); }
237 static void deallocate(_Tp* __p) argument
264 deallocate(void* __p, size_t __n) argument
271 reallocate(void* __p, size_t __old_sz, size_t __new_sz) argument
431 deallocate(void* __p, size_t __n) argument
498 _Obj* __p; local
563 reallocate(void* __p, size_t __old_sz, size_t __new_sz) argument
764 deallocate(pointer __p, size_type __n) argument
770 construct(pointer __p, const _Tp& __val) argument
771 destroy(pointer __p) argument
842 deallocate(pointer __p, size_type __n) argument
848 construct(pointer __p, const _Tp& __val) argument
849 destroy(pointer __p) argument
[all...]
H A Dpthread_alloc148 static void deallocate(void *__p, size_t __n)
150 __obj *__q = (__obj *)__p;
155 malloc_alloc::deallocate(__p, __n);
168 static void * reallocate(void *__p, size_t __old_sz, size_t __new_sz);
322 ::reallocate(void *__p, size_t __old_sz, size_t __new_sz)
329 return(realloc(__p, __new_sz));
331 if (_S_round_up(__old_sz) == _S_round_up(__new_sz)) return(__p);
334 memcpy(__result, __p, __copy_sz);
335 deallocate(__p, __old_sz);
400 void deallocate(pointer __p, size_typ
[all...]
H A Dstl_tempbuf.h74 void return_temporary_buffer(_Tp* __p) { argument
75 free(__p);
H A Dstl_function.h490 _Ret operator()(_Tp* __p) const { return (__p->*_M_f)(); }
499 _Ret operator()(const _Tp* __p) const { return (__p->*_M_f)(); }
527 _Ret operator()(_Tp* __p, _Arg __x) const { return (__p->*_M_f)(__x); } argument
536 _Ret operator()(const _Tp* __p, _Arg __x) const argument
537 { return (__p->*_M_f)(__x); }
566 void operator()(_Tp* __p) const { (__p
602 operator ()(_Tp* __p, _Arg __x) const argument
612 operator ()(const _Tp* __p, _Arg __x) const argument
[all...]
H A Dstl_list.h145 void _M_put_node(_List_node<_Tp>* __p) argument
146 { _Node_allocator.deallocate(__p, 1); }
169 void _M_put_node(_List_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1); } argument
223 void _M_put_node(_List_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1); } argument
291 _Node* __p = _M_get_node(); local
293 construct(&__p->_M_data, __x);
295 __STL_UNWIND(_M_put_node(__p));
296 return __p;
301 _Node* __p = _M_get_node(); local
[all...]
H A Dstl_tree.h455 void _M_put_node(_Rb_tree_node<_Tp>* __p) argument
456 { _M_node_allocator.deallocate(__p, 1); }
476 void _M_put_node(_Rb_tree_node<_Tp>* __p) argument
477 { _Alloc_type::deallocate(__p, 1); }
515 void _M_put_node(_Rb_tree_node<_Tp>* __p) argument
516 { _Alloc_type::deallocate(__p, 1); }
571 void destroy_node(_Link_type __p) argument
573 destroy(&__p->_M_value_field);
574 _M_put_node(__p);
639 _Link_type _M_copy(_Link_type __x, _Link_type __p);
1042 pair<iterator,iterator> __p = equal_range(__x); local
1052 _M_copy(_Link_type __x, _Link_type __p) argument
1156 pair<const_iterator, const_iterator> __p = equal_range(__k); local
[all...]
H A Dstl_set.h133 pair<typename _Rep_type::iterator, bool> __p = _M_t.insert_unique(__x); local
134 return pair<iterator, bool>(__p.first, __p.second);
H A Dstl_hash_set.h158 pair<typename _Ht::iterator, bool> __p = _M_ht.insert_unique(__obj); local
159 return pair<iterator,bool>(__p.first, __p.second);
174 pair<typename _Ht::iterator, bool> __p = local
176 return pair<iterator, bool>(__p.first, __p.second);
H A Dstl_vector.h71 void _M_deallocate(_Tp* __p, size_t __n) argument
72 { if (__p) _M_data_allocator.deallocate(__p, __n); }
96 void _M_deallocate(_Tp* __p, size_t __n) argument
97 { _Alloc_type::deallocate(__p, __n);}
148 void _M_deallocate(_Tp* __p, size_t __n)
149 { _M_data_allocator::deallocate(__p, __n); }
H A Dstl_deque.h293 void _M_deallocate_node(_Tp* __p) { argument
294 node_allocator.deallocate(__p, __deque_buf_size(__bufsiz,sizeof(_Tp)));
298 void _M_deallocate_map(_Tp** __p, size_t __n) argument
299 { map_allocator.deallocate(__p, __n); }
322 void _M_deallocate_node(_Tp* __p) argument
323 { _Node_alloc_type::deallocate(__p, __deque_buf_size(__bufsiz,
327 void _M_deallocate_map(_Tp** __p, size_t __n) argument
328 { _Map_alloc_type::deallocate(__p, __n); }
407 void _M_deallocate_node(_Tp* __p) argument
408 { _Node_alloc_type::deallocate(__p, __deque_buf_siz
412 _M_deallocate_map(_Tp** __p, size_t __n) argument
[all...]
H A Dstl_hashtable.h214 void _M_put_node(_Node* __p) { _M_node_allocator.deallocate(__p, 1); } argument
223 void _M_put_node(_Node* __p) { _M_node_allocator_type::deallocate(__p, 1); } argument
848 if (_Node* const __p = __it._M_cur) {
849 const size_type __n = _M_bkt_num(__p->_M_val);
852 if (__cur == __p) {
860 if (__next == __p) {
H A Dstl_algo.h296 _ForwardIter2 __p1, __p;
307 __p = __p1;
312 while (*__current == *__p) {
313 if (++__p == __last2)
341 _ForwardIter2 __p1, __p;
358 __p = __p1;
362 while (__predicate(*__current, *__p)) {
363 if (++__p == __last2)
785 _RandomAccessIter __p = __first; local
789 if (__p > __firs
[all...]
H A Dstl_slist.h195 void _M_put_node(_Slist_node<_Tp>* __p) argument
196 { _M_node_allocator.deallocate(__p, 1); }
218 void _M_put_node(_Slist_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1); } argument
265 void _M_put_node(_Slist_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1); } argument
H A Dropeimpl.h275 const _CharT* __p = __s; local
277 while (!_S_is0(*__p)) { ++__p; }
278 return (__p - __s);
772 _Rope_find_char_char_consumer(_CharT __p) argument
773 : _M_pattern(__p), _M_count(0) {}
/haiku/src/system/libroot/posix/glibc/include/
H A Dwchar.h20 __mbstate_t *__restrict __p);
/haiku/src/system/libroot/posix/glibc/libio/
H A DlibioP.h507 #define _IO_setp(__fp, __p, __ep) \
509 = __p, (__fp)->_IO_write_end = (__ep))
510 #define _IO_wsetp(__fp, __p, __ep) \
512 = (__fp)->_wide_data->_IO_write_ptr = __p, \
/haiku/src/system/libroot/posix/glibc/wcsmbs/
H A Dwchar.h161 mbstate_t *__restrict __p) __THROW;

Completed in 1336 milliseconds