Home
last modified time | relevance | path

Searched refs:__a (Results 1 – 25 of 37) sorted by relevance

12

/haiku/headers/cpp/std/
H A Dvalarray_array.h47 __valarray_fill (_Tp* __restrict__ __a, size_t __n, const _Tp& __t) in __valarray_fill() argument
48 { while (__n--) *__a++ = __t; } in __valarray_fill()
53 __valarray_fill (_Tp* __restrict__ __a, size_t __n, in __valarray_fill() argument
55 { for (size_t __i=0; __i<__n; ++__i, __a+=__s) *__a = __t; } in __valarray_fill()
60 __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i, in __valarray_fill() argument
62 { for (size_t __j=0; __j<__n; ++__j, ++__i) __a[*__i] = __t; } in __valarray_fill()
67 __valarray_copy (const _Tp* __restrict__ __a, size_t __n, in __valarray_copy() argument
69 { memcpy (__b, __a, __n * sizeof(_Tp)); } in __valarray_copy()
74 __valarray_copy (const _Tp* __restrict__ __a, size_t __n, size_t __s, in __valarray_copy() argument
76 { for (size_t __i=0; __i<__n; ++__i, ++__b, __a += __s) *__b = *__a; } in __valarray_copy()
[all …]
H A Dvalarray_array.tcc39 __valarray_fill (_Array<_Tp> __a, size_t __n, _Array<bool> __m, const _Tp& __t) in __valarray_fill() argument
41 _Tp* __p = __a._M_data; in __valarray_fill()
54 __valarray_copy (_Array<_Tp> __a, _Array<bool> __m, _Array<_Tp> __b, size_t __n) in __valarray_copy() argument
56 _Tp* __p (__a._M_data); in __valarray_copy()
69 __valarray_copy (_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, _Array<bool> __m) in __valarray_copy() argument
73 for (_Tp* __p=__a._M_data; __p<__a._M_data+__n; ++__p, ++__ok, ++__q) { in __valarray_copy()
84 __valarray_copy (const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a) in __valarray_copy() argument
86 _Tp* __p (__a._M_data); in __valarray_copy()
93 _Array<_Tp> __a, size_t __s) in __valarray_copy() argument
95 _Tp* __p (__a._M_data); in __valarray_copy()
[all …]
H A Dindirect_array.h95 inline indirect_array<_Tp>::indirect_array(const indirect_array<_Tp>& __a) in indirect_array() argument
96 : _M_sz (__a._M_sz), _M_index (__a._M_index), in indirect_array()
97 _M_array (__a._M_array) {} in indirect_array()
101 indirect_array<_Tp>::indirect_array (_Array<_Tp> __a, size_t __s, in indirect_array() argument
103 : _M_sz (__s), _M_index (__i), _M_array (__a) {} in indirect_array()
H A Dgslice_array.h96 gslice_array<_Tp>::gslice_array (_Array<_Tp> __a, in gslice_array() argument
98 : _M_array (__a), _M_index (__i) {} in gslice_array()
103 gslice_array<_Tp>::gslice_array (const gslice_array<_Tp>& __a) in gslice_array() argument
104 : _M_array (__a._M_array), _M_index (__a._M_index) {} in gslice_array()
H A Dstd_valarray.h490 _Tp* const __a = static_cast<_Tp*> (alloca (sizeof(_Tp) * _M_size)); in shift() local
492 __valarray_copy (_M_data, _M_size, __a); in shift()
495 __valarray_fill(__a, __n, _Tp()); in shift()
497 __valarray_copy (_M_data+__n, _M_size-__n, __a); in shift()
498 __valarray_fill (__a+_M_size-__n, __n, _Tp()); in shift()
502 __valarray_copy (_M_data, _M_size+__n, __a-__n); in shift()
503 __valarray_fill(__a, -__n, _Tp()); in shift()
505 return valarray<_Tp> (__a, _M_size); in shift()
512 _Tp* const __a = static_cast<_Tp*> (alloca (sizeof(_Tp) * _M_size)); in cshift() local
514 __valarray_copy(_M_data, _M_size, __a); in cshift()
[all …]
/haiku/headers/cpp/
H A Dmemory37 auto_ptr(auto_ptr& __a) __STL_NOTHROW : _M_ptr(__a.release()) {}
38 template <class _Tp1> auto_ptr(auto_ptr<_Tp1>& __a) __STL_NOTHROW
39 : _M_ptr(__a.release()) {}
40 auto_ptr& operator=(auto_ptr& __a) __STL_NOTHROW {
41 if (&__a != this) {
43 _M_ptr = __a.release();
48 auto_ptr& operator=(auto_ptr<_Tp1>& __a) __STL_NOTHROW {
49 if (__a.get() != this->get()) {
51 _M_ptr = __a.release();
H A Dstl_algobase.h64 inline void __iter_swap(_ForwardIter1 __a, _ForwardIter2 __b, _Tp*) { in __iter_swap() argument
65 _Tp __tmp = *__a; in __iter_swap()
66 *__a = *__b; in __iter_swap()
71 inline void iter_swap(_ForwardIter1 __a, _ForwardIter2 __b) { in iter_swap() argument
72 __iter_swap(__a, __b, __VALUE_TYPE(__a)); in iter_swap()
76 inline void swap(_Tp& __a, _Tp& __b) { in swap() argument
77 _Tp __tmp = __a; in swap()
78 __a = __b; in swap()
91 inline const _Tp& min(const _Tp& __a, const _Tp& __b) { in min() argument
92 return __b < __a ? __b : __a; in min()
[all …]
H A Dstl_rope.h252 #define __ROPE_DEFINE_ALLOCS(__a) \ argument
254 typedef _Rope_RopeConcatenation<_CharT,__a> __C; \
256 typedef _Rope_RopeLeaf<_CharT,__a> __L; \
258 typedef _Rope_RopeFunction<_CharT,__a> __F; \
260 typedef _Rope_RopeSubstring<_CharT,__a> __S; \
284 _Rope_rep_alloc_base(size_t __size, const allocator_type& __a) in _Rope_rep_alloc_base() argument
285 : _M_size(__size), _M_data_allocator(__a) {} in _Rope_rep_alloc_base()
340 _Rope_rep_base(size_t __size, const allocator_type& __a) in _Rope_rep_base()
341 : _Base(__size, __a) {} in _Rope_rep_base()
388 allocator_type __a) in _Rope_RopeRep()
[all …]
H A Dstl_set.h77 const allocator_type& __a = allocator_type())
78 : _M_t(__comp, __a) {} in _M_t() argument
88 const allocator_type& __a = allocator_type())
89 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); } in _M_t() argument
97 const allocator_type& __a = allocator_type())
98 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); } in _M_t() argument
105 const allocator_type& __a = allocator_type())
106 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); } in _M_t() argument
H A Dstl_multiset.h77 const allocator_type& __a = allocator_type())
78 : _M_t(__comp, __a) {} in _M_t() argument
90 const allocator_type& __a = allocator_type())
91 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _M_t() argument
101 const allocator_type& __a = allocator_type())
102 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _M_t() argument
110 const allocator_type& __a = allocator_type())
111 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _M_t() argument
H A Dstl_hash_map.h88 const allocator_type& __a = allocator_type())
89 : _M_ht(__n, __hf, __eql, __a) {} in _M_ht() argument
108 const allocator_type& __a = allocator_type())
109 : _M_ht(__n, __hf, __eql, __a) in _M_ht() argument
125 const allocator_type& __a = allocator_type())
126 : _M_ht(__n, __hf, __eql, __a) in _M_ht() argument
141 const allocator_type& __a = allocator_type())
142 : _M_ht(__n, __hf, __eql, __a) in _M_ht() argument
271 const allocator_type& __a = allocator_type())
272 : _M_ht(__n, __hf, __eql, __a) {} in _M_ht() argument
[all …]
H A Dstl_hash_set.h86 const allocator_type& __a = allocator_type())
87 : _M_ht(__n, __hf, __eql, __a) {} in _M_ht() argument
106 const allocator_type& __a = allocator_type())
107 : _M_ht(__n, __hf, __eql, __a) in _M_ht() argument
123 const allocator_type& __a = allocator_type())
124 : _M_ht(__n, __hf, __eql, __a) in _M_ht() argument
139 const allocator_type& __a = allocator_type())
140 : _M_ht(__n, __hf, __eql, __a) in _M_ht() argument
265 const allocator_type& __a = allocator_type())
266 : _M_ht(__n, __hf, __eql, __a) {} in _M_ht() argument
[all …]
H A Dstl_multimap.h91 const allocator_type& __a = allocator_type())
92 : _M_t(__comp, __a) { } in _M_t() argument
103 const allocator_type& __a = allocator_type())
104 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _M_t() argument
111 const allocator_type& __a = allocator_type())
112 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _M_t() argument
119 const allocator_type& __a = allocator_type())
120 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _M_t() argument
H A Dstl_map.h92 const allocator_type& __a = allocator_type())
93 : _M_t(__comp, __a) {} in _M_t() argument
103 const allocator_type& __a = allocator_type())
104 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); } in _M_t() argument
112 const allocator_type& __a = allocator_type())
113 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); } in _M_t() argument
120 const allocator_type& __a = allocator_type())
121 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); } in _M_t() argument
H A Dstl_bvector.h257 _Bvector_alloc_base(const allocator_type& __a) in _Bvector_alloc_base() argument
258 : _M_data_allocator(__a), _M_start(), _M_finish(), _M_end_of_storage(0) {} in _Bvector_alloc_base()
315 _Bvector_base(const allocator_type& __a) : _Base(__a) {} in _Bvector_base() argument
523 explicit __BVECTOR(const allocator_type& __a = allocator_type())
524 : _Base(__a) {} in _Base() argument
527 const allocator_type& __a = allocator_type())
528 : _Base(__a) in _Base() argument
550 const allocator_type& __a = allocator_type())
551 : _Base(__a) in _Base() argument
570 const allocator_type& __a = allocator_type())
[all …]
H A Dstl_pair.h44 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {} in pair()
H A Dstl_list.h140 _List_alloc_base(const allocator_type& __a) : _Node_allocator(__a) {} in _List_alloc_base() argument
186 _List_base(const allocator_type& __a) : _Base(__a) { in _List_base() argument
310 explicit list(const allocator_type& __a = allocator_type()) : _Base(__a) {} in _Base() argument
405 const allocator_type& __a = allocator_type())
406 : _Base(__a) in _Base() argument
418 const allocator_type& __a = allocator_type())
419 : _Base(__a) in _Base() argument
425 const allocator_type& __a = allocator_type())
426 : _Base(__a) in _Base() argument
429 const allocator_type& __a = allocator_type())
[all …]
H A Dstl_vector.h59 _Vector_alloc_base(const allocator_type& __a) in _Vector_alloc_base() argument
60 : _M_data_allocator(__a), _M_start(0), _M_finish(0), _M_end_of_storage(0) in _Vector_alloc_base()
110 _Vector_base(const allocator_type& __a) : _Base(__a) {} in _Vector_base()
111 _Vector_base(size_t __n, const allocator_type& __a) : _Base(__a) { in _Vector_base()
235 explicit vector(const allocator_type& __a = allocator_type())
236 : _Base(__a) {} in _Base() argument
239 const allocator_type& __a = allocator_type())
240 : _Base(__n, __a) in _Base() argument
255 const allocator_type& __a = allocator_type()) : _Base(__a) { in _Base() argument
275 const allocator_type& __a = allocator_type())
[all …]
H A Dpthread_alloc127 _Pthread_alloc_per_thread_state<_Max_size>* __a;
133 !(__a = (_Pthread_alloc_per_thread_state<_Max_size>*)
135 __a = _S_get_per_thread_state();
137 __my_free_list = __a -> __free_list + _S_freelist_index(__n);
140 void *__r = __a -> _M_refill(_S_round_up(__n));
152 _Pthread_alloc_per_thread_state<_Max_size>* __a;
159 !(__a = (_Pthread_alloc_per_thread_state<_Max_size> *)
161 __a = _S_get_per_thread_state();
163 __my_free_list = __a->__free_list + _S_freelist_index(__n);
249 _Pthread_alloc_per_thread_state<_Max_size>* __a =
[all …]
H A Dstl_slist.h190 _Slist_alloc_base(const allocator_type& __a) : _M_node_allocator(__a) {} in _Slist_alloc_base() argument
235 _Slist_base(const allocator_type& __a) : _Base(__a) { _M_head._M_next = 0; } in _Slist_base()
353 explicit slist(const allocator_type& __a = allocator_type()) : _Base(__a) {} in _Base() argument
356 const allocator_type& __a = allocator_type()) : _Base(__a) in _Base() argument
367 const allocator_type& __a = allocator_type()) : _Base(__a) in _Base() argument
372 const allocator_type& __a = allocator_type()) : _Base(__a) in _Base() argument
375 const allocator_type& __a = allocator_type()) : _Base(__a) in _Base() argument
/haiku/src/system/libroot/posix/glibc/stdlib/
H A Ddrand48-iter.c41 buffer->__a = 0x5deece66dull;
52 result = X * buffer->__a + buffer->__c;
H A Dlonglong.h142 UDItype __xr = (X), __t, __a; \
144 __a = __clz_tab[__t ^ 0xff] - 1; \
145 __asm__("extbl %1,%2,%0" : "=r"(__t) : "r"(__xr), "r"(__a)); \
146 (COUNT) = 64 - (__clz_tab[__t] + __a*8); \
150 UDItype __xr = (X), __t, __a; \
153 __a = ((__t & 0xCC) != 0) * 2; \
154 __a += ((__t & 0xF0) != 0) * 4; \
155 __a += ((__t & 0xAA) != 0); \
156 __asm__("extbl %1,%2,%0" : "=r"(__t) : "r"(__xr), "r"(__a)); \
157 __a <<= 3; \
[all …]
H A Dsrand48_r.c36 buffer->__a = 0x5deece66dull;
H A Dlcong48_r.c32 buffer->__a = ((uint64_t) param[5] << 32 | (uint32_t) param[4] << 16
H A Dseed48_r.c36 buffer->__a = 0x5deece66dull;

12