Home
last modified time | relevance | path

Searched refs:__x (Results 1 – 25 of 173) sorted by relevance

1234567

/freebsd-11-stable/contrib/llvm-project/clang/lib/Headers/
HDtgmath.h49 #define __tg_promote1(__x) (__typeof__(__tg_promote(__x))) argument
50 #define __tg_promote2(__x, __y) (__typeof__(__tg_promote(__x) + \ argument
52 #define __tg_promote3(__x, __y, __z) (__typeof__(__tg_promote(__x) + \ argument
60 __tg_acos(float __x) {return acosf(__x);} in __tg_acos() argument
64 __tg_acos(double __x) {return acos(__x);} in __tg_acos() argument
68 __tg_acos(long double __x) {return acosl(__x);} in __tg_acos() argument
72 __tg_acos(float _Complex __x) {return cacosf(__x);} in __tg_acos() argument
76 __tg_acos(double _Complex __x) {return cacos(__x);} in __tg_acos() argument
80 __tg_acos(long double _Complex __x) {return cacosl(__x);} in __tg_acos() argument
83 #define acos(__x) __tg_acos(__tg_promote1((__x))(__x)) argument
[all …]
HD__clang_cuda_cmath.h51 __DEVICE__ float abs(float __x) { return ::fabsf(__x); } in abs() argument
52 __DEVICE__ double abs(double __x) { return ::fabs(__x); } in abs() argument
56 __DEVICE__ const float abs(const float __x) { return ::fabsf((float)__x); } in abs() argument
57 __DEVICE__ const double abs(const double __x) { return ::fabs((double)__x); } in abs() argument
59 __DEVICE__ float acos(float __x) { return ::acosf(__x); } in acos() argument
60 __DEVICE__ float asin(float __x) { return ::asinf(__x); } in asin() argument
61 __DEVICE__ float atan(float __x) { return ::atanf(__x); } in atan() argument
62 __DEVICE__ float atan2(float __x, float __y) { return ::atan2f(__x, __y); } in atan2() argument
63 __DEVICE__ float ceil(float __x) { return ::ceilf(__x); } in ceil() argument
64 __DEVICE__ float cos(float __x) { return ::cosf(__x); } in cos() argument
[all …]
/freebsd-11-stable/contrib/libstdc++/include/c_std/
Dstd_cmath.h89 abs(double __x) in abs() argument
90 { return __builtin_fabs(__x); } in abs()
93 abs(float __x) in abs() argument
94 { return __builtin_fabsf(__x); } in abs()
97 abs(long double __x) in abs() argument
98 { return __builtin_fabsl(__x); } in abs()
103 acos(float __x) in acos() argument
104 { return __builtin_acosf(__x); } in acos()
107 acos(long double __x) in acos() argument
108 { return __builtin_acosl(__x); } in acos()
[all …]
/freebsd-11-stable/contrib/libstdc++/src/
Dtree.cc63 _Rb_tree_increment(_Rb_tree_node_base* __x) in _GLIBCXX_BEGIN_NAMESPACE()
65 if (__x->_M_right != 0) in _GLIBCXX_BEGIN_NAMESPACE()
67 __x = __x->_M_right; in _GLIBCXX_BEGIN_NAMESPACE()
68 while (__x->_M_left != 0) in _GLIBCXX_BEGIN_NAMESPACE()
69 __x = __x->_M_left; in _GLIBCXX_BEGIN_NAMESPACE()
73 _Rb_tree_node_base* __y = __x->_M_parent; in _GLIBCXX_BEGIN_NAMESPACE()
74 while (__x == __y->_M_right) in _GLIBCXX_BEGIN_NAMESPACE()
76 __x = __y; in _GLIBCXX_BEGIN_NAMESPACE()
79 if (__x->_M_right != __y) in _GLIBCXX_BEGIN_NAMESPACE()
80 __x = __y; in _GLIBCXX_BEGIN_NAMESPACE()
[all …]
Dlist.cc61 _List_node_base::swap(_List_node_base& __x, _List_node_base& __y) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
63 if ( __x._M_next != &__x ) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
68 std::swap(__x._M_next,__y._M_next); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
69 std::swap(__x._M_prev,__y._M_prev); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
70 __x._M_next->_M_prev = __x._M_prev->_M_next = &__x; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
76 __y._M_next = __x._M_next; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
77 __y._M_prev = __x._M_prev; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
79 __x._M_next = __x._M_prev = &__x; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
85 __x._M_next = __y._M_next; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
86 __x._M_prev = __y._M_prev; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
/freebsd-11-stable/contrib/libstdc++/include/tr1/
Dcmath335 acosh(float __x)
336 { return __builtin_acoshf(__x); }
339 acosh(long double __x)
340 { return __builtin_acoshl(__x); }
344 acosh(_Tp __x)
347 return acosh(__type(__x));
353 asinh(float __x)
354 { return __builtin_asinhf(__x); }
357 asinh(long double __x)
358 { return __builtin_asinhl(__x); }
[all …]
Drandom.tcc55 __calc(_Tp __x) in __calc()
58 __x %= __m; in __calc()
64 _Tp __t1 = __a * (__x % __q); in __calc()
65 _Tp __t2 = __r * (__x / __q); in __calc()
67 __x = __t1 - __t2; in __calc()
69 __x = __m - __t2 + __t1; in __calc()
74 const _Tp __d = __m - __x; in __calc()
76 __x += __c; in __calc()
78 __x = __c - __d; in __calc()
80 return __x; in __calc()
[all …]
/freebsd-11-stable/contrib/libstdc++/include/bits/
Dstl_tree.h106 _S_minimum(_Base_ptr __x) in _S_minimum()
108 while (__x->_M_left != 0) __x = __x->_M_left; in _S_minimum()
109 return __x; in _S_minimum()
113 _S_minimum(_Const_Base_ptr __x) in _S_minimum()
115 while (__x->_M_left != 0) __x = __x->_M_left; in _S_minimum()
116 return __x; in _S_minimum()
120 _S_maximum(_Base_ptr __x) in _S_maximum()
122 while (__x->_M_right != 0) __x = __x->_M_right; in _S_maximum()
123 return __x; in _S_maximum()
127 _S_maximum(_Const_Base_ptr __x) in _S_maximum()
[all …]
Dstl_function.h137 operator()(const _Tp& __x, const _Tp& __y) const in operator()
138 { return __x + __y; } in operator()
146 operator()(const _Tp& __x, const _Tp& __y) const in operator()
147 { return __x - __y; } in operator()
155 operator()(const _Tp& __x, const _Tp& __y) const in operator()
156 { return __x * __y; } in operator()
164 operator()(const _Tp& __x, const _Tp& __y) const in operator()
165 { return __x / __y; } in operator()
173 operator()(const _Tp& __x, const _Tp& __y) const in operator()
174 { return __x % __y; } in operator()
[all …]
Dstl_set.h193 set(const set& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
194 : _M_t(__x._M_t) { } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
204 operator=(const set& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
206 _M_t = __x._M_t; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
286 swap(set& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
287 { _M_t.swap(__x._M_t); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
304 insert(const value_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
307 _M_t._M_insert_unique(__x); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
331 insert(iterator __position, const value_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
332 { return _M_t._M_insert_unique(__position, __x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
Dstl_multiset.h183 multiset(const multiset& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
184 : _M_t(__x._M_t) { } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
194 operator=(const multiset& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
196 _M_t = __x._M_t; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
278 swap(multiset& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
279 { _M_t.swap(__x._M_t); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
294 insert(const value_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
295 { return _M_t._M_insert_equal(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
318 insert(iterator __position, const value_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
319 { return _M_t._M_insert_equal(__position, __x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
Dstl_list.h81 swap(_List_node_base& __x, _List_node_base& __y);
127 _List_iterator(_List_node_base* __x) in _List_iterator()
128 : _M_node(__x) { } in _List_iterator()
170 operator==(const _Self& __x) const
171 { return _M_node == __x._M_node; }
174 operator!=(const _Self& __x) const
175 { return _M_node != __x._M_node; }
205 _List_const_iterator(const _List_node_base* __x) in _List_const_iterator()
206 : _M_node(__x) { } in _List_const_iterator()
208 _List_const_iterator(const iterator& __x) in _List_const_iterator()
[all …]
Dstl_multimap.h121 bool operator()(const value_type& __x, const value_type& __y) const in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
122 { return comp(__x.first, __y.first); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
173 multimap(const multimap& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
174 : _M_t(__x._M_t) { } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
225 operator=(const multimap& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
227 _M_t = __x._M_t; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
339 insert(const value_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
340 { return _M_t._M_insert_equal(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
363 insert(iterator __position, const value_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
364 { return _M_t._M_insert_equal(__position, __x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
Dstl_map.h122 bool operator()(const value_type& __x, const value_type& __y) const in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
123 { return comp(__x.first, __y.first); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
175 map(const map& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
176 : _M_t(__x._M_t) { } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
226 operator=(const map& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
228 _M_t = __x._M_t; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
399 insert(const value_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
400 { return _M_t._M_insert_unique(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
426 insert(iterator __position, const value_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
427 { return _M_t._M_insert_unique(__position, __x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
Dstl_bvector.h75 _Bit_reference(_Bit_type * __x, _Bit_type __y) in _Bit_reference()
76 : _M_p(__x), _M_mask(__y) { } in _Bit_reference()
84 operator=(bool __x)
86 if (__x)
94 operator=(const _Bit_reference& __x)
95 { return *this = bool(__x); }
98 operator==(const _Bit_reference& __x) const
99 { return bool(*this) == bool(__x); }
102 operator<(const _Bit_reference& __x) const
103 { return !bool(*this) && bool(__x); }
[all …]
Dstl_deque.h124 _Deque_iterator(_Tp* __x, _Map_pointer __y) in _Deque_iterator()
125 : _M_cur(__x), _M_first(*__y), in _Deque_iterator()
130 _Deque_iterator(const iterator& __x) in _Deque_iterator()
131 : _M_cur(__x._M_cur), _M_first(__x._M_first), in _Deque_iterator()
132 _M_last(__x._M_last), _M_node(__x._M_node) {} in _Deque_iterator()
243 operator==(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,
245 { return __x._M_cur == __y._M_cur; }
250 operator==(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,
252 { return __x._M_cur == __y._M_cur; }
256 operator!=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,
[all …]
Dstl_iterator.h124 reverse_iterator(iterator_type __x) : current(__x) { } in _GLIBCXX_BEGIN_NAMESPACE()
129 reverse_iterator(const reverse_iterator& __x) in _GLIBCXX_BEGIN_NAMESPACE()
130 : current(__x.current) { } in _GLIBCXX_BEGIN_NAMESPACE()
137 reverse_iterator(const reverse_iterator<_Iter>& __x) in _GLIBCXX_BEGIN_NAMESPACE()
138 : current(__x.base()) { } in _GLIBCXX_BEGIN_NAMESPACE()
282 operator==(const reverse_iterator<_Iterator>& __x,
284 { return __x.base() == __y.base(); }
288 operator<(const reverse_iterator<_Iterator>& __x,
290 { return __y.base() < __x.base(); }
294 operator!=(const reverse_iterator<_Iterator>& __x,
[all …]
Dstl_pair.h96 operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
97 { return __x.first == __y.first && __x.second == __y.second; }
102 operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
103 { return __x.first < __y.first
104 || (!(__y.first < __x.first) && __x.second < __y.second); }
109 operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
110 { return !(__x == __y); }
115 operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
116 { return __y < __x; }
121 operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
[all …]
/freebsd-11-stable/contrib/llvm-project/libcxx/include/
HDcomplex258 template<class _Tp> complex<_Tp> operator/(const complex<_Tp>& __x, const complex<_Tp>& __y);
531 operator+(const complex<_Tp>& __x, const complex<_Tp>& __y)
533 complex<_Tp> __t(__x);
541 operator+(const complex<_Tp>& __x, const _Tp& __y)
543 complex<_Tp> __t(__x);
551 operator+(const _Tp& __x, const complex<_Tp>& __y)
554 __t += __x;
561 operator-(const complex<_Tp>& __x, const complex<_Tp>& __y)
563 complex<_Tp> __t(__x);
571 operator-(const complex<_Tp>& __x, const _Tp& __y)
[all …]
/freebsd-11-stable/contrib/libstdc++/include/ext/
Dhash_fun.h102 operator()(char __x) const
103 { return __x; }
110 operator()(unsigned char __x) const
111 { return __x; }
118 operator()(unsigned char __x) const
119 { return __x; }
126 operator()(short __x) const
127 { return __x; }
134 operator()(unsigned short __x) const
135 { return __x; }
[all …]
/freebsd-11-stable/contrib/libstdc++/include/debug/
Dmultiset.h89 multiset(const multiset<_Key,_Compare,_Allocator>& __x) in multiset() argument
90 : _Base(__x), _Safe_base() { } in multiset()
92 multiset(const _Base& __x) : _Base(__x), _Safe_base() { } in multiset() argument
97 operator=(const multiset<_Key,_Compare,_Allocator>& __x)
99 *static_cast<_Base*>(this) = __x;
146 insert(const value_type& __x) in insert() argument
147 { return iterator(_Base::insert(__x), this); } in insert()
150 insert(iterator __position, const value_type& __x) in insert() argument
153 return iterator(_Base::insert(__position.base(), __x), this); in insert()
173 erase(const key_type& __x) in erase() argument
[all …]
Dset.h89 set(const set<_Key,_Compare,_Allocator>& __x) in set() argument
90 : _Base(__x), _Safe_base() { } in set()
92 set(const _Base& __x) : _Base(__x), _Safe_base() { } in set() argument
97 operator=(const set<_Key,_Compare,_Allocator>& __x)
99 *static_cast<_Base*>(this) = __x;
146 insert(const value_type& __x) in insert() argument
149 std::pair<_Base_iterator, bool> __res = _Base::insert(__x); in insert()
155 insert(iterator __position, const value_type& __x) in insert() argument
158 return iterator(_Base::insert(__position.base(), __x), this); in insert()
178 erase(const key_type& __x) in erase() argument
[all …]
Dmultimap.h89 multimap(const multimap<_Key,_Tp,_Compare,_Allocator>& __x) in multimap() argument
90 : _Base(__x), _Safe_base() { } in multimap()
92 multimap(const _Base& __x) : _Base(__x), _Safe_base() { } in multimap() argument
97 operator=(const multimap<_Key,_Tp,_Compare,_Allocator>& __x)
99 *static_cast<_Base*>(this) = __x;
146 insert(const value_type& __x) in insert() argument
147 { return iterator(_Base::insert(__x), this); } in insert()
150 insert(iterator __position, const value_type& __x) in insert() argument
153 return iterator(_Base::insert(__position.base(), __x), this); in insert()
173 erase(const key_type& __x) in erase() argument
[all …]
/freebsd-11-stable/contrib/libstdc++/include/std/
Dstd_complex.h318 operator+(const complex<_Tp>& __x, const complex<_Tp>& __y)
320 complex<_Tp> __r = __x;
327 operator+(const complex<_Tp>& __x, const _Tp& __y)
329 complex<_Tp> __r = __x;
336 operator+(const _Tp& __x, const complex<_Tp>& __y)
339 __r.real() += __x;
348 operator-(const complex<_Tp>& __x, const complex<_Tp>& __y)
350 complex<_Tp> __r = __x;
357 operator-(const complex<_Tp>& __x, const _Tp& __y)
359 complex<_Tp> __r = __x;
[all …]
/freebsd-11-stable/contrib/libstdc++/include/c/
Dstd_cmath.h85 abs(double __x) in abs() argument
86 { return __builtin_fabs(__x); } in abs()
89 abs(float __x) in abs() argument
90 { return __builtin_fabsf(__x); } in abs()
93 abs(long double __x) in abs() argument
94 { return __builtin_fabsl(__x); } in abs()
98 modf(float __x, float* __iptr) { return modff(__x, __iptr); } in modf() argument
101 modf(float __x, float* __iptr) in modf() argument
104 double __res = modf(static_cast<double>(__x), &__tmp); in modf()
112 modf(long double __x, long double* __iptr) { return modfl(__x, __iptr); } in modf() argument
[all …]

1234567