/haiku/src/libs/stdc++/legacy/ |
H A D | valarray.cc | 26 size_t* const __t = static_cast<size_t*>(alloca(__n*sizeof(size_t))); local 27 __valarray_fill(__t, __n, size_t(0)); 32 __i[__j] += __s[__k]*__t[__k]; 33 ++__t[__n-1]; 35 if (__t[__k] >= __l[__k]) { 36 __t[__k] = 0; 37 ++__t[__k-1];
|
/haiku/headers/build/gcc-2.95.3/ |
H A D | va-sh.h | 155 ? ({union {TYPE t; char c;} __t; \ 157 : "=r" (__t.c) \ 159 __t.t;}) \ 161 ? ({union {TYPE t; short s;} __t; \ 163 : "=r" (__t.s) \ 165 __t.t;}) \
|
/haiku/headers/cpp/std/ |
H A D | valarray_array.h | 44 // fill plain array __a[<__n>] with __t 47 __valarray_fill (_Tp* __restrict__ __a, size_t __n, const _Tp& __t) argument 48 { while (__n--) *__a++ = __t; } 50 // fill strided array __a[<__n-1 : __s>] with __t 54 size_t __s, const _Tp& __t) 55 { for (size_t __i=0; __i<__n; ++__i, __a+=__s) *__a = __t; } 61 size_t __n, const _Tp& __t) 62 { for (size_t __j=0; __j<__n; ++__j, ++__i) __a[*__i] = __t; } 121 __valarray_fill (_Array<_Tp> __a, size_t __n, const _Tp& __t) argument 122 { __valarray_fill (__a._M_data, __n, __t); } 53 __valarray_fill(_Tp* __restrict__ __a, size_t __n, size_t __s, const _Tp& __t) argument 60 __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i, size_t __n, const _Tp& __t) argument 126 __valarray_fill(_Array<_Tp> __a, size_t __n, size_t __s, const _Tp& __t) argument 131 __valarray_fill(_Array<_Tp> __a, _Array<size_t> __i, size_t __n, const _Tp& __t) argument [all...] |
H A D | std_valarray.h | 235 _Tp operator() (const _Tp& __t) const { return __t; } 251 _Tp operator() (_Tp __t) const { return ~__t; } 292 inline valarray<_Tp>::valarray (const _Tp& __t, size_t __n) argument 294 { __valarray_fill (_M_data, _M_size, __t); } 348 valarray<_Tp>::operator= (const _Tp& __t) argument 350 __valarray_fill (_M_data, _M_size, __t); 594 valarray<_Tp>::operator##_Op##= (const _Tp &__t) \ 596 _Array_augmented_##_Name (_Array<_Tp>(_M_data), _M_size, __t); \ [all...] |
H A D | valarray_meta.h | 202 _BinFunClos (const _Dom& __e, const _Tp& __t, _Tp __f (_Tp, _Tp)) argument 203 : _Base (__e, __t, __f) {} 213 _BinFunClos (const _Tp& __t, const _Dom& __e, _Tp __f (_Tp, _Tp)) argument 214 : _Base (__t, __e, __f) {} 223 _BinFunClos (const valarray<_Tp>& __v, const _Tp& __t, argument 225 : _Base (__v, __t, __f) {} 234 _BinFunClos (const _Tp& __t, const valarray<_Tp>& __v, argument 236 : _Base (__t, __v, __f) {} 375 _BinBase2 (const _Clos& __e, const _Vt& __t) argument 376 : _M_expr1 (__e), _M_expr2 (__t) {} 398 _BinBase1(const _Vt& __t, const _Clos& __e) argument 482 _BinClos(const valarray<_Tp>& __v, const _Tp& __t) argument 492 _BinClos(const _Tp& __t, const valarray<_Tp>& __v) argument [all...] |
H A D | gslice_array.h | 109 gslice_array<_Tp>::operator= (const _Tp& __t) argument 112 _M_index.size(), __t);
|
H A D | indirect_array.h | 108 indirect_array<_Tp>::operator= (const _Tp& __t) argument 109 { __valarray_fill(_M_array, _M_index, _M_sz, __t); }
|
H A D | mask_array.h | 104 mask_array<_T>::operator= (const _T& __t) argument 105 { __valarray_fill (_M_array, _M_sz, _M_mask, __t); }
|
H A D | slice_array.h | 106 slice_array<_T>::operator= (const _T& __t) argument 107 { __valarray_fill (_M_array, _M_sz, _M_stride, __t); }
|
/haiku/src/system/libroot/posix/glibc/stdlib/ |
H A D | longlong.h | 142 UDItype __xr = (X), __t, __a; \ 143 __asm__("cmpbge $31,%1,%0" : "=r"(__t) : "r"(__xr)); \ 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; \ 151 __asm__("cmpbge $31,%1,%0" : "=r"(__t) : "r"(__xr)); \ 152 __t = ~__t & -~__t; \ [all...] |
/haiku/headers/cpp/ |
H A D | stl_rope.h | 387 _Rope_RopeRep(_Tag __t, int __d, bool __b, size_t __size, argument 390 _M_tag(__t), _M_depth(__d), _M_is_balanced(__b), _M_c_string(0) 510 static void _S_unref(_Rope_RopeRep* __t) argument 512 if (0 != __t) { 513 __t->_M_unref_nonnil(); 516 static void _S_ref(_Rope_RopeRep* __t) argument 518 if (0 != __t) __t->_M_incr_refcount(); 520 static void _S_free_if_unref(_Rope_RopeRep* __t) argument 522 if (0 != __t 1170 _Rope_alloc_base(_RopeRep *__t, const allocator_type& __a) argument 1200 _Rope_alloc_base(_RopeRep *__t, const allocator_type&) argument 1230 _Rope_base(_RopeRep* __t, const allocator_type& __a) argument 1242 _Rope_base(_RopeRep * __t, const allocator_type&) argument 1359 _S_unref(_RopeRep* __t) argument 1363 _S_ref(_RopeRep* __t) argument 1546 rope(_RopeRep* __t, const allocator_type& __a = allocator_type()) argument [all...] |
H A D | stl_deque.h | 694 void push_back(const value_type& __t) { argument 696 construct(_M_finish._M_cur, __t); 700 _M_push_back_aux(__t); 712 void push_front(const value_type& __t) { argument 714 construct(_M_start._M_cur - 1, __t); 718 _M_push_front_aux(__t); 1149 deque<_Tp,_Alloc,__bufsize>::_M_push_back_aux(const value_type& __t) argument 1151 value_type __t_copy = __t; 1180 deque<_Tp,_Alloc,__bufsize>::_M_push_front_aux(const value_type& __t) argument 1182 value_type __t_copy = __t; [all...] |
H A D | stl_tree.h | 702 void swap(_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __t) { argument 703 __STD::swap(_M_header, __t._M_header); 704 __STD::swap(_M_node_count, __t._M_node_count); 705 __STD::swap(_M_key_compare, __t._M_key_compare);
|
H A D | stl_algo.h | 697 _EuclideanRingElement __t = __m % __n; local 699 __n = __t; 915 _Distance __t = __n; local 920 ++__t; 921 _Distance __M = __random_number(__t); 938 _Distance __t = __n; local 943 ++__t; 944 _Distance __M = __rand(__t);
|