Searched refs:__t (Results 1 - 23 of 23) sorted by relevance

/freebsd-11-stable/contrib/libstdc++/include/tr1/
H A Dtuple_defs.h49 get(tuple<_GLIBCXX_TEMPLATE_ARGS>& __t) argument
51 return __get_helper<__i, tuple<_GLIBCXX_TEMPLATE_ARGS> >::get_value(__t);
56 get(const tuple<_GLIBCXX_TEMPLATE_ARGS>& __t) argument
58 return __get_helper<__i, tuple<_GLIBCXX_TEMPLATE_ARGS> >::get_value(__t);
63 operator==(const tuple<_GLIBCXX_TEMPLATE_ARGS>& __t, argument
69 tuple_size<_Tp>::value, _Tp, _Up>::__eq(__t, __u);
74 operator<(const tuple<_GLIBCXX_TEMPLATE_ARGS>& __t, argument
80 tuple_size<_Tp>::value, _Tp, _Up>::__less(__t, __u);
85 operator!=(const tuple<_GLIBCXX_TEMPLATE_ARGS>& __t, argument
87 { return !(__t
91 operator >(const tuple<_GLIBCXX_TEMPLATE_ARGS>& __t, const tuple<_GLIBCXX_TEMPLATE_ARGS_U>& __u) argument
97 operator <=(const tuple<_GLIBCXX_TEMPLATE_ARGS>& __t, const tuple<_GLIBCXX_TEMPLATE_ARGS_U>& __u) argument
103 operator >=(const tuple<_GLIBCXX_TEMPLATE_ARGS>& __t, const tuple<_GLIBCXX_TEMPLATE_ARGS_U>& __u) argument
[all...]
H A Dref_fwd.h50 ref(_Tp& __t);
55 cref(const _Tp& __t);
/freebsd-11-stable/contrib/libstdc++/src/
H A Dvalarray-inst.cc59 valarray<size_t>& __t = const_cast<valarray<size_t>&>(__a); local
60 return __valarray_product(&__t[0], &__t[0] + __n);
76 size_t* const __t = static_cast<size_t*> local
78 __valarray_fill(__t, __n, size_t(0));
92 __a += __s[__k] * __t[__k];
98 ++__t[__n - 1];
101 if (__t[__k2] >= __l[__k2])
103 __t[__k2] = 0;
104 ++__t[__k
[all...]
/freebsd-11-stable/contrib/libstdc++/include/bits/
H A Dvalarray_before.h70 _Tp operator()(const _Tp& __t) const
71 { return abs(__t); }
77 _Tp operator()(const _Tp& __t) const
78 { return cos(__t); }
84 _Tp operator()(const _Tp& __t) const
85 { return acos(__t); }
91 _Tp operator()(const _Tp& __t) const
92 { return cosh(__t); }
98 _Tp operator()(const _Tp& __t) const
99 { return sin(__t); }
544 _BinBase2(const _Clos& __e, const _Vt& __t) argument
564 _BinBase1(const _Vt& __t, const _Clos& __e) argument
651 _BinClos(const valarray<_Tp>& __v, const _Tp& __t) argument
661 _BinClos(const _Tp& __t, const valarray<_Tp>& __v) argument
[all...]
H A Dvalarray_array.h104 // Turn a raw-memory into an array of _Tp filled with __t
113 _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t) argument
116 new(__b++) _Tp(__t);
124 _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t) argument
127 *__b++ = __t;
134 const _Tp __t)
136 _Array_init_ctor<_Tp, __is_pod<_Tp>::__value>::_S_do_it(__b, __e, __t);
223 // Fill a plain array __a[<__n>] with __t
226 __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t) argument
229 *__a++ = __t;
133 __valarray_fill_construct(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t) argument
235 __valarray_fill(_Tp* __restrict__ __a, size_t __n, size_t __s, const _Tp& __t) argument
245 __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i, size_t __n, const _Tp& __t) argument
385 _Value_type __t = __a[__i]; local
401 _Value_type __t = __a[__i]; local
445 __valarray_fill(_Array<_Tp> __a, size_t __n, const _Tp& __t) argument
450 __valarray_fill(_Array<_Tp> __a, size_t __n, size_t __s, const _Tp& __t) argument
455 __valarray_fill(_Array<_Tp> __a, _Array<size_t> __i, size_t __n, const _Tp& __t) argument
[all...]
H A Dboost_concept_check.h239 void __aux_require_boolean_expr(const _Tp& __t) { argument
240 bool __x _IsUnused = __t;
468 *__i++ = __t; // require postincrement and assignment
471 _ValueT __t;
731 __c _IsUnused(__n, __t),
734 __c.insert(__p, __t);
735 __c.insert(__p, __n, __t);
748 typename _Sequence::value_type __t;
760 __c.push_front(__t);
764 typename _FrontInsertionSequence::value_type __t;
[all...]
H A Dstl_tree.h673 swap(_Rb_tree& __t);
938 swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t) argument
942 if (__t._M_root() != 0)
944 _M_root() = __t._M_root();
945 _M_leftmost() = __t._M_leftmost();
946 _M_rightmost() = __t._M_rightmost();
949 __t._M_root() = 0;
950 __t._M_leftmost() = __t._M_end();
951 __t
[all...]
H A Dmask_array.h157 mask_array<_Tp>::operator=(const _Tp& __t) const
158 { std::__valarray_fill(_M_array, _M_sz, _M_mask, __t); }
H A Dvalarray_after.h359 const typename _Dom::value_type& __t) \
364 return _Expr<_Closure, _Value>(_Closure(__v(), __t)); \
371 operator _Op(const typename _Dom::value_type& __t, \
377 return _Expr<_Closure, _Value>(_Closure(__t, __v())); \
504 const typename _Dom::value_type& __t) \
508 return _Expr<_Closure, _Tp>(_Closure(__e(), __t)); \
515 _Fun(const typename _Dom::value_type& __t, \
520 return _Expr<_Closure, _Tp>(_Closure(__t, __e())); \
533 _Fun(const valarray<_Tp>& __v, const _Tp& __t) \
536 return _Expr<_Closure, _Tp>(_Closure(__v, __t)); \
[all...]
H A Dgslice_array.h157 gslice_array<_Tp>::operator=(const _Tp& __t) const
160 _M_index.size(), __t);
H A Dindirect_array.h162 indirect_array<_Tp>::operator=(const _Tp& __t) const
163 { std::__valarray_fill(_M_array, _M_index, _M_sz, __t); }
H A Dslice_array.h222 slice_array<_Tp>::operator=(const _Tp& __t) const
223 { std::__valarray_fill(_M_array, _M_sz, _M_stride, __t); }
H A Dlocale_facets.h929 const char __t = do_narrow(__c, __dfault); local
930 if (__t != __dfault)
931 _M_narrow[static_cast<unsigned char>(__c)] = __t;
932 return __t;
H A Dstl_algo.h1742 _EuclideanRingElement __t = __m % __n; local
1744 __n = __t;
/freebsd-11-stable/contrib/llvm-project/clang/lib/Headers/
H A Darm_acle.h130 __clz(uint32_t __t) { argument
131 return __builtin_clz(__t);
135 __clzl(unsigned long __t) { argument
136 return __builtin_clzl(__t);
140 __clzll(uint64_t __t) { argument
141 return __builtin_clzll(__t);
146 __cls(uint32_t __t) { argument
147 return __builtin_arm_cls(__t);
151 __clsl(unsigned long __t) { argument
153 return __builtin_arm_cls(__t);
160 __clsll(uint64_t __t) argument
166 __rev(uint32_t __t) argument
171 __revl(unsigned long __t) argument
180 __revll(uint64_t __t) argument
186 __rev16(uint32_t __t) argument
191 __rev16ll(uint64_t __t) argument
196 __rev16l(unsigned long __t) argument
206 __revsh(int16_t __t) argument
212 __rbit(uint32_t __t) argument
217 __rbitll(uint64_t __t) argument
227 __rbitl(unsigned long __t) argument
280 __qadd(int32_t __t, int32_t __v) argument
285 __qsub(int32_t __t, int32_t __v) argument
290 __qdbl(int32_t __t) argument
[all...]
H A Dsmmintrin.h869 ({ union { int __i; float __f; } __t; \
870 __t.__f = __builtin_ia32_vec_ext_v4sf((__v4sf)(__m128)(X), (int)(N)); \
871 __t.__i;}))
H A D__clang_cuda_device_functions.h1650 __DEVICE__ double norm(int __dim, const double *__t) { argument
1651 return __nv_norm(__dim, __t);
1669 __DEVICE__ float normf(int __dim, const float *__t) { argument
1670 return __nv_normf(__dim, __t);
1713 __DEVICE__ float rnormf(int __dim, const float *__t) { argument
1714 return __nv_rnormf(__dim, __t);
/freebsd-11-stable/contrib/gcc/
H A Dtree.h583 ({ const tree __t = (T); \
584 if (TREE_CODE (__t) != (CODE)) \
585 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
587 __t; })
590 ({ const tree __t = (T); \
591 if (TREE_CODE (__t) == (CODE)) \
592 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
594 __t; })
597 ({ const tree __t = (T); \
598 if (TREE_CODE (__t) !
[all...]
H A Dlonglong.h135 UDItype __xr = (X), __t, __a; \
136 __t = __builtin_alpha_cmpbge (0, __xr); \
137 __a = __clz_tab[__t ^ 0xff] - 1; \
138 __t = __builtin_alpha_extbl (__xr, __a); \
139 (COUNT) = 64 - (__clz_tab[__t] + __a*8); \
143 UDItype __xr = (X), __t, __a; \
144 __t = __builtin_alpha_cmpbge (0, __xr); \
145 __t = ~__t & -~__t; \
[all...]
/freebsd-11-stable/contrib/libstdc++/include/std/
H A Dstd_complex.h205 complex<_Tp>::operator=(const _Tp& __t) argument
207 _M_real = __t;
215 complex<_Tp>::operator+=(const _Tp& __t) argument
217 _M_real += __t;
224 complex<_Tp>::operator-=(const _Tp& __t) argument
226 _M_real -= __t;
233 complex<_Tp>::operator*=(const _Tp& __t) argument
235 _M_real *= __t;
236 _M_imag *= __t;
243 complex<_Tp>::operator/=(const _Tp& __t) argument
848 _Tp __t = sqrt(abs(__y) / 2); local
853 _Tp __t = sqrt(2 * (std::abs(__z) + abs(__x))); local
1135 _ComplexT __t; local
1136 __real__ __t = __z.real(); local
1137 __imag__ __t = __z.imag(); local
1146 _ComplexT __t; local
1147 __real__ __t = __z.real(); local
1148 __imag__ __t = __z.imag(); local
1288 _ComplexT __t; local
1289 __real__ __t = __z.real(); local
1290 __imag__ __t = __z.imag(); local
1299 _ComplexT __t; local
1300 __real__ __t = __z.real(); local
1301 __imag__ __t = __z.imag(); local
1441 _ComplexT __t; local
1442 __real__ __t = __z.real(); local
1443 __imag__ __t = __z.imag(); local
1452 _ComplexT __t; local
1453 __real__ __t = __z.real(); local
1454 __imag__ __t = __z.imag(); local
[all...]
H A Dstd_valarray.h561 valarray<_Tp>::valarray(const _Tp& __t, size_t __n) argument
563 { std::__valarray_fill_construct(_M_data, _M_data + __n, __t); }
644 valarray<_Tp>::operator=(const _Tp& __t) argument
646 std::__valarray_fill(_M_data, _M_size, __t);
932 valarray<_Tp>::operator _Op##=(const _Tp &__t) \
934 _Array_augmented_##_Name(_Array<_Tp>(_M_data), _M_size, __t); \
999 operator _Op(const valarray<_Tp>& __v, const _Tp& __t) \
1003 return _Expr<_Closure, _Rt>(_Closure(__v, __t)); \
1009 operator _Op(const _Tp& __t, const valarray<_Tp>& __v) \
1013 return _Expr<_Closure, _Rt>(_Closure(__t, __
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/
H A Dmt_allocator.h140 _M_set_options(_Tune __t) argument
143 _M_options = __t;
663 _M_set_options(__pool_base::_Tune __t) argument
664 { __policy_type::_S_get_pool()._M_set_options(__t); }
/freebsd-11-stable/contrib/gcc/cp/
H A Dcp-tree.h181 ({ const tree __t = (NODE); \
182 if (TREE_CODE (__t) != FUNCTION_DECL && \
183 TREE_CODE (__t) != TEMPLATE_DECL && __t->decl_common.lang_specific \
184 && __t->decl_common.lang_specific->decl_flags.thunk_p) \
185 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, 0); \
186 __t; })
188 ({ const tree __t = (NODE); \
189 if (TREE_CODE (__t) != FUNCTION_DECL || !__t
[all...]

Completed in 243 milliseconds