Home
last modified time | relevance | path

Searched refs:__t (Results 1 – 15 of 15) sorted by relevance

/haiku/src/libs/stdc++/legacy/
H A Dvalarray.cc26 size_t* const __t = static_cast<size_t*>(alloca(__n*sizeof(size_t))); in __gslice_to_index() local
27 __valarray_fill(__t, __n, size_t(0)); in __gslice_to_index()
32 __i[__j] += __s[__k]*__t[__k]; in __gslice_to_index()
33 ++__t[__n-1]; in __gslice_to_index()
35 if (__t[__k] >= __l[__k]) { in __gslice_to_index()
36 __t[__k] = 0; in __gslice_to_index()
37 ++__t[__k-1]; in __gslice_to_index()
/haiku/headers/build/gcc-2.95.3/
H A Dva-sh.h155 ? ({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 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()
54 size_t __s, const _Tp& __t) in __valarray_fill() argument
55 { for (size_t __i=0; __i<__n; ++__i, __a+=__s) *__a = __t; } in __valarray_fill()
61 size_t __n, const _Tp& __t) in __valarray_fill() argument
62 { for (size_t __j=0; __j<__n; ++__j, ++__i) __a[*__i] = __t; } in __valarray_fill()
121 __valarray_fill (_Array<_Tp> __a, size_t __n, const _Tp& __t) in __valarray_fill() argument
122 { __valarray_fill (__a._M_data, __n, __t); } in __valarray_fill()
126 __valarray_fill (_Array<_Tp> __a, size_t __n, size_t __s, const _Tp& __t) in __valarray_fill() argument
127 { __valarray_fill (__a._M_data, __n, __s, __t); } in __valarray_fill()
[all …]
H A Dvalarray_meta.h202 _BinFunClos (const _Dom& __e, const _Tp& __t, _Tp __f (_Tp, _Tp))
203 : _Base (__e, __t, __f) {}
213 _BinFunClos (const _Tp& __t, const _Dom& __e, _Tp __f (_Tp, _Tp))
214 : _Base (__t, __e, __f) {}
223 _BinFunClos (const valarray<_Tp>& __v, const _Tp& __t,
225 : _Base (__v, __t, __f) {}
234 _BinFunClos (const _Tp& __t, const valarray<_Tp>& __v,
236 : _Base (__t, __v, __f) {}
375 _BinBase2 (const _Clos& __e, const _Vt& __t)
376 : _M_expr1 (__e), _M_expr2 (__t) {}
[all …]
H A Dstd_valarray.h235 _Tp operator() (const _Tp& __t) const { return __t; } in operator()
251 _Tp operator() (_Tp __t) const { return ~__t; } in operator()
292 inline valarray<_Tp>::valarray (const _Tp& __t, size_t __n) in valarray() argument
294 { __valarray_fill (_M_data, _M_size, __t); } in valarray()
348 valarray<_Tp>::operator= (const _Tp& __t)
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); \
657 operator##_Op (const valarray<_Tp> &__v, const _Tp &__t) \
660 return _Expr<_Closure, _Tp> (_Closure (__v, __t)); \
[all …]
H A Dvalarray_array.tcc39 __valarray_fill (_Array<_Tp> __a, size_t __n, _Array<bool> __m, const _Tp& __t) in __valarray_fill() argument
48 *__p = __t; in __valarray_fill()
H A Dslice_array.h106 slice_array<_T>::operator= (const _T& __t)
107 { __valarray_fill (_M_array, _M_sz, _M_stride, __t); }
H A Dgslice_array.h109 gslice_array<_Tp>::operator= (const _Tp& __t)
112 _M_index.size(), __t);
H A Dindirect_array.h108 indirect_array<_Tp>::operator= (const _Tp& __t)
109 { __valarray_fill(_M_array, _M_index, _M_sz, __t); }
H A Dmask_array.h104 mask_array<_T>::operator= (const _T& __t)
105 { __valarray_fill (_M_array, _M_sz, _M_mask, __t); }
/haiku/src/system/libroot/posix/glibc/stdlib/
H A Dlonglong.h142 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; \
153 __a = ((__t & 0xCC) != 0) * 2; \
154 __a += ((__t & 0xF0) != 0) * 4; \
[all …]
/haiku/headers/cpp/
H A Dstl_rope.h387 _Rope_RopeRep(_Tag __t, int __d, bool __b, size_t __size, in _Rope_RopeRep()
390 _M_tag(__t), _M_depth(__d), _M_is_balanced(__b), _M_c_string(0) in _Rope_RopeRep()
510 static void _S_unref(_Rope_RopeRep* __t) in _S_unref()
512 if (0 != __t) { in _S_unref()
513 __t->_M_unref_nonnil(); in _S_unref()
516 static void _S_ref(_Rope_RopeRep* __t) in _S_ref()
518 if (0 != __t) __t->_M_incr_refcount(); in _S_ref()
520 static void _S_free_if_unref(_Rope_RopeRep* __t) in _S_free_if_unref()
522 if (0 != __t && 0 == __t->_M_refcount) __t->_M_free_tree(); in _S_free_if_unref()
1170 _Rope_alloc_base(_RopeRep *__t, const allocator_type& __a) in _Rope_alloc_base() argument
[all …]
H A Dstl_deque.h694 void push_back(const value_type& __t) { in push_back() argument
696 construct(_M_finish._M_cur, __t); in push_back()
700 _M_push_back_aux(__t); in push_back()
712 void push_front(const value_type& __t) { in push_front() argument
714 construct(_M_start._M_cur - 1, __t); in push_front()
718 _M_push_front_aux(__t); in push_front()
1149 deque<_Tp,_Alloc,__bufsize>::_M_push_back_aux(const value_type& __t) in _M_push_back_aux() argument
1151 value_type __t_copy = __t; in _M_push_back_aux()
1180 deque<_Tp,_Alloc,__bufsize>::_M_push_front_aux(const value_type& __t) in _M_push_front_aux() argument
1182 value_type __t_copy = __t; in _M_push_front_aux()
H A Dstl_algo.h697 _EuclideanRingElement __t = __m % __n; in __gcd() local
699 __n = __t; in __gcd()
915 _Distance __t = __n; in __random_sample() local
920 ++__t; in __random_sample()
921 _Distance __M = __random_number(__t); in __random_sample()
938 _Distance __t = __n; in __random_sample() local
943 ++__t; in __random_sample()
944 _Distance __M = __rand(__t); in __random_sample()
H A Dstl_tree.h702 void swap(_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __t) { in swap() argument
703 __STD::swap(_M_header, __t._M_header); in swap()
704 __STD::swap(_M_node_count, __t._M_node_count); in swap()
705 __STD::swap(_M_key_compare, __t._M_key_compare); in swap()