Home
last modified time | relevance | path

Searched refs:__y (Results 1 – 25 of 97) sorted by relevance

1234

/external/clang/lib/Headers/
Dtgmath.h57 #define __tg_promote2(__x, __y) (__typeof__(__tg_promote(__x) + \ argument
58 __tg_promote(__y)))
59 #define __tg_promote3(__x, __y, __z) (__typeof__(__tg_promote(__x) + \ argument
60 __tg_promote(__y) + \
473 __tg_pow(float __x, float __y) {return powf(__x, __y);} in __tg_pow() argument
477 __tg_pow(double __x, double __y) {return pow(__x, __y);} in __tg_pow() argument
481 __tg_pow(long double __x, long double __y) {return powl(__x, __y);} in __tg_pow() argument
485 __tg_pow(float _Complex __x, float _Complex __y) {return cpowf(__x, __y);} in __tg_pow() argument
489 __tg_pow(double _Complex __x, double _Complex __y) {return cpow(__x, __y);} in __tg_pow() argument
493 __tg_pow(long double _Complex __x, long double _Complex __y) in __tg_pow() argument
[all …]
Dammintrin.h38 _mm_extract_si64(__m128i __x, __m128i __y) in _mm_extract_si64() argument
40 return (__m128i)__builtin_ia32_extrq((__v2di)__x, (__v16qi)__y); in _mm_extract_si64()
49 _mm_insert_si64(__m128i __x, __m128i __y) in _mm_insert_si64() argument
51 return (__m128i)__builtin_ia32_insertq((__v2di)__x, (__v2di)__y); in _mm_insert_si64()
/external/stlport/stlport/stl/
D_pair.h81 inline bool _STLP_CALL operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
82 { return __x.first == __y.first && __x.second == __y.second; }
85 inline bool _STLP_CALL operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) {
86 return __x.first < __y.first ||
87 (!(__y.first < __x.first) && __x.second < __y.second);
92 inline bool _STLP_CALL operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
93 { return !(__x == __y); }
96 inline bool _STLP_CALL operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
97 { return __y < __x; }
100 inline bool _STLP_CALL operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
[all …]
D_tree.c62 _Rb_tree_node_base* __y = __x->_M_right; in _Rotate_left() local
63 __x->_M_right = __y->_M_left; in _Rotate_left()
64 if (__y->_M_left != 0) in _Rotate_left()
65 __y->_M_left->_M_parent = __x; in _Rotate_left()
66 __y->_M_parent = __x->_M_parent; in _Rotate_left()
69 __root = __y; in _Rotate_left()
71 __x->_M_parent->_M_left = __y; in _Rotate_left()
73 __x->_M_parent->_M_right = __y; in _Rotate_left()
74 __y->_M_left = __x; in _Rotate_left()
75 __x->_M_parent = __y; in _Rotate_left()
[all …]
D_string_operators.h30 const basic_string<_CharT,_Traits,_Alloc>& __y) {
35 _Str __result = _Str(_Reserve_t(), __s.size() + __y.size(), __s.get_allocator());
37 _Str __result(_Reserve_t(), __s.size() + __y.size(), __s.get_allocator());
40 __result.append(__y);
47 const basic_string<_CharT,_Traits,_Alloc>& __y) {
53 _Str __result = _Str(_Reserve_t(), __n + __y.size(), __y.get_allocator());
55 _Str __result(_Reserve_t(), __n + __y.size(), __y.get_allocator());
58 __result.append(__y);
65 const basic_string<_CharT,_Traits,_Alloc>& __y) {
69 _Str __result = _Str(_Reserve_t(), 1 + __y.size(), __y.get_allocator());
[all …]
D_relops_cont.h8 const _STLP_TEMPLATE_CONTAINER& __y) {
9 return __x.size() == __y.size() &&
10 equal(__x.begin(), __x.end(), __y.begin());
16 const _STLP_TEMPLATE_CONTAINER& __y) {
18 __y.begin(), __y.end());
26 _STLP_TEMPLATE_CONTAINER& __y) { in _STLP_RELOPS_OPERATORS()
27 __x.swap(__y); in _STLP_RELOPS_OPERATORS()
D_function_base.h66 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x == __y; } in operator()
79 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x < __y; } in operator()
115 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x + __y; }
120 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x - __y; }
135 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x * __y; }
162 _Arg2 operator()(const _Arg1&, const _Arg2& __y) const { return __y; }
172 # define _STLP_SELECT1ST(__x,__y) _STLP_PRIV __Select1st_hint< __x, __y >
174 # define _STLP_SELECT1ST(__x, __y) _STLP_PRIV _Select1st< __x >
D_iterator_old.h136 Reference__, _Distance>& __y)
137 { return __x.base() == __y.base(); }
144 const reverse_bidirectional_iterator<_BiIter, _Tp, Reference__, _Distance>& __y)
145 { return !(__x == __y); }
243 Reference__, _Distance>& __y)
245 return __x.base() == __y.base();
254 Reference__, _Distance>& __y)
256 return __y.base() < __x.base();
267 Reference__, _Distance>& __y) {
268 return !(__x == __y);
[all …]
D_function.h45 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x != __y; } in operator()
50 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x > __y; } in operator()
55 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x >= __y; } in operator()
60 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x <= __y; } in operator()
65 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x / __y; } in operator()
70 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x % __y; } in operator()
80 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x && __y; } in operator()
85 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x || __y; } in operator()
176 bool operator()(_FstArgParamType __x, _SndArgParamType __y) const { in operator()
177 return !_M_pred(__x, __y); in operator()
[all …]
D_cmath.h411 inline double __stlp_ldexp(double __x, int __y) { return ldexp(__x, __y); } in __stlp_ldexp() argument
413 inline double ldexp(double __x, int __y) { return __stlp_ldexp(__x, __y); } in ldexp() argument
458 inline float pow(float __x, int __y) { return _STLP_CMATH_FUNC_NAMESPACE::powf(__x, __STATIC_CAST(f…
460 inline float pow(float __x, int __y) { return ::__powf(__x, __STATIC_CAST(float,__y)); }
463 …ine float pow(float __x, int __y) { return __STATIC_CAST(float, _STLP_CMATH_FUNC_NAMESPACE::pow(__…
465 inline double pow(double __x, int __y) { return _STLP_CMATH_FUNC_NAMESPACE::pow(__x, __STATIC_CAST(… in pow() argument
469 …ong double pow(long double __x, int __y) { return _STLP_CMATH_FUNC_NAMESPACE::powl(__x, __STATIC_C… in pow() argument
472 inline long double pow(long double __x, int __y) { return ::__powl(__x, __STATIC_CAST(long double,_… in pow() argument
474 …e long double pow(long double __x, int __y) { return _STLP_VENDOR_CSTD::__powl(__x, __STATIC_CAST(… in pow() argument
478 …w(long double __x, int __y) { return __STATIC_CAST(long double, _STLP_CMATH_FUNC_NAMESPACE::pow(__… in pow() argument
[all …]
D_iterator.h114 const reverse_iterator<_Iterator>& __y)
115 { return __x.base() == __y.base(); }
119 const reverse_iterator<_Iterator>& __y)
120 { return __y.base() < __x.base(); }
125 const reverse_iterator<_Iterator>& __y)
126 { return !(__x == __y); }
130 const reverse_iterator<_Iterator>& __y)
131 { return __y < __x; }
135 const reverse_iterator<_Iterator>& __y)
136 { return !(__y < __x); }
[all …]
D_cstdlib.h114 inline _STLP_VENDOR_CSTD::div_t div(int __x, int __y) { return _STLP_VENDOR_CSTD::div(__x, __y); } in div() argument
137 inline _STLP_VENDOR_CSTD::ldiv_t div(long __x, long __y) { return _STLP_VENDOR_CSTD::ldiv(__x, __y)… in div() argument
152 …ine lldiv_t div(_STLP_LONG_LONG __x, _STLP_LONG_LONG __y) { return _STLP_VENDOR_CSTD::lldiv(__x, _… in div() argument
155 inline lldiv_t div(_STLP_LONG_LONG __x, _STLP_LONG_LONG __y) { return ::lldiv(__x, __y); } in div() argument
D_deque.h106 _Deque_iterator_base(value_type* __x, _Map_pointer __y) in _Deque_iterator_base()
107 : _M_cur(__x), _M_first(*__y), in _Deque_iterator_base()
108 _M_last(*__y + _S_buffer_size()), _M_node(__y) {} in _Deque_iterator_base()
178 _Deque_iterator(value_type* __x, _Map_pointer __y) : in _Deque_iterator()
179 _Deque_iterator_base<value_type>(__x,__y) {} in _Deque_iterator()
234 const _Deque_iterator_base<_Tp >& __y)
235 { return __x._M_cur == __y._M_cur; }
240 const _Deque_iterator_base<_Tp >& __y) {
241 return (__x._M_node == __y._M_node) ?
242 (__x._M_cur < __y._M_cur) : (__x._M_node < __y._M_node);
[all …]
D_bvector.h45 _Bit_reference(unsigned int* __x, unsigned int __y) in _Bit_reference()
46 : _M_p(__x), _M_mask(__y) {} in _Bit_reference()
85 inline void swap(_STLP_PRIV _Bit_reference& __x, _STLP_PRIV _Bit_reference& __y) { in swap() argument
87 __x = __y; in swap()
88 __y = __tmp; in swap()
124 _Bit_iterator_base(unsigned int* __x, unsigned int __y) : _M_p(__x), _M_offset(__y) {}
147 inline bool _STLP_CALL operator==(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) {
148 return __y._M_p == __x._M_p && __y._M_offset == __x._M_offset;
150 inline bool _STLP_CALL operator!=(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) {
151 return __y._M_p != __x._M_p || __y._M_offset != __x._M_offset;
[all …]
D_valarray.h379 const valarray<_Tp>& __y) {
380 _STLP_ASSERT(__x.size() == __y.size())
384 __tmp[__i] = __x[__i] * __y[__i];
390 const valarray<_Tp>& __y) {
391 _STLP_ASSERT(__x.size() == __y.size())
395 __tmp[__i] = __x[__i] / __y[__i];
401 const valarray<_Tp>& __y) {
402 _STLP_ASSERT(__x.size() == __y.size())
406 __tmp[__i] = __x[__i] % __y[__i];
412 const valarray<_Tp>& __y) {
[all …]
/external/libcxx/include/
Dtypeindex63 type_index(const type_info& __y) _NOEXCEPT : __t_(&__y) {}
66 bool operator==(const type_index& __y) const _NOEXCEPT
67 {return *__t_ == *__y.__t_;}
69 bool operator!=(const type_index& __y) const _NOEXCEPT
70 {return *__t_ != *__y.__t_;}
72 bool operator< (const type_index& __y) const _NOEXCEPT
73 {return __t_->before(*__y.__t_);}
75 bool operator<=(const type_index& __y) const _NOEXCEPT
76 {return !__y.__t_->before(*__t_);}
78 bool operator> (const type_index& __y) const _NOEXCEPT
[all …]
Dcmath463 __libcpp_isgreater(_A1 __x, _A2 __y) _NOEXCEPT
465 return isgreater(__x, __y);
478 isgreater(_A1 __x, _A2 __y) _NOEXCEPT
481 return __libcpp_isgreater((type)__x, (type)__y);
493 __libcpp_isgreaterequal(_A1 __x, _A2 __y) _NOEXCEPT
495 return isgreaterequal(__x, __y);
508 isgreaterequal(_A1 __x, _A2 __y) _NOEXCEPT
511 return __libcpp_isgreaterequal((type)__x, (type)__y);
523 __libcpp_isless(_A1 __x, _A2 __y) _NOEXCEPT
525 return isless(__x, __y);
[all …]
Dstack99 operator==(const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y);
104 operator< (const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y);
219 operator==(const stack<T1, _C1>& __x, const stack<T1, _C1>& __y);
224 operator< (const stack<T1, _C1>& __x, const stack<T1, _C1>& __y);
230 operator==(const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y)
232 return __x.c == __y.c;
238 operator< (const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y)
240 return __x.c < __y.c;
246 operator!=(const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y)
248 return !(__x == __y);
[all …]
Dsystem_error473 operator<(const error_condition& __x, const error_condition& __y) _NOEXCEPT
475 return __x.category() < __y.category()
476 || (__x.category() == __y.category() && __x.value() < __y.value());
550 operator<(const error_code& __x, const error_code& __y) _NOEXCEPT
552 return __x.category() < __y.category()
553 || (__x.category() == __y.category() && __x.value() < __y.value());
558 operator==(const error_code& __x, const error_code& __y) _NOEXCEPT
560 return __x.category() == __y.category() && __x.value() == __y.value();
565 operator==(const error_code& __x, const error_condition& __y) _NOEXCEPT
567 return __x.category().equivalent(__x.value(), __y)
[all …]
Drandom1894 const linear_congruential_engine& __y)
1895 {return __x.__x_ == __y.__x_;}
1898 const linear_congruential_engine& __y)
1899 {return !(__x == __y);}
2023 _Bp, _Tp, _Cp, _Lp, _Fp>& __y);
2033 _Bp, _Tp, _Cp, _Lp, _Fp>& __y);
2140 _Bp, _Tp, _Cp, _Lp, _Fp>& __y);
2150 _Bp, _Tp, _Cp, _Lp, _Fp>& __y);
2394 _Bp, _Tp, _Cp, _Lp, _Fp>& __y)
2396 if (__x.__i_ == __y.__i_)
[all …]
Dcomplex261 template<class _Tp> complex<_Tp> operator/(const complex<_Tp>& __x, const complex<_Tp>& __y);
528 operator+(const complex<_Tp>& __x, const complex<_Tp>& __y)
531 __t += __y;
538 operator+(const complex<_Tp>& __x, const _Tp& __y)
541 __t += __y;
548 operator+(const _Tp& __x, const complex<_Tp>& __y)
550 complex<_Tp> __t(__y);
558 operator-(const complex<_Tp>& __x, const complex<_Tp>& __y)
561 __t -= __y;
568 operator-(const complex<_Tp>& __x, const _Tp& __y)
[all …]
/external/stlport/stlport/stl/debug/
D_iterator.h61 ptrdiff_t _DBG_distance(const _Iterator& __x, const _Iterator& __y, const random_access_iterator_ta… in _DBG_distance() argument
62 { return __x - __y; } in _DBG_distance()
89 bool _CompareIt(const _Iterator& __x, const _Iterator& __y, const random_access_iterator_tag &) in _CompareIt() argument
90 { return __x < __y; } in _CompareIt()
176 const _DBG_iter_base<_Container>& __y ) {
178 _STLP_DEBUG_CHECK(__check_same_owner(__x, __y))
179 return _DBG_distance(__x._M_iterator,__y._M_iterator, _Iterator_category());
306 operator==(const _DBG_iter_base<_Container>& __x, const _DBG_iter_base<_Container>& __y) {
307 _STLP_DEBUG_CHECK(__check_same_or_null_owner(__x, __y))
308 return __x._M_iterator == __y._M_iterator;
[all …]
/external/stlport/stlport/stl/config/
Dfeatures.h586 #define __C_CAST(__x, __y) ((__x)(__y)) argument
588 # define __CONST_CAST(__x,__y) const_cast<__x>(__y) argument
589 # define __STATIC_CAST(__x,__y) static_cast<__x>(__y) argument
590 # define __REINTERPRET_CAST(__x,__y) reinterpret_cast<__x>(__y) argument
592 # define __STATIC_CAST(__x,__y) __C_CAST(__x, __y) argument
593 # define __CONST_CAST(__x,__y) __C_CAST(__x, __y) argument
594 # define __REINTERPRET_CAST(__x,__y) __C_CAST(__x, __y) argument
1044 _TMPL inline bool _STLP_CALL operator!=(const _TP& __x, const _TP& __y) {return !(__x == __y);}\
1045 _TMPL inline bool _STLP_CALL operator>(const _TP& __x, const _TP& __y) {return __y < __x;}\
1046 _TMPL inline bool _STLP_CALL operator<=(const _TP& __x, const _TP& __y) { return !(__y < __x);}\
[all …]
D_watcom.h148 # define _STLP_ATOMIC_EXCHANGE(__x, __y) __stl_InterlockedExchange((long*)__x, (long)__y) argument
149 # define _STLP_ATOMIC_EXCHANGE_PTR(__x, __y) __stl_InterlockedExchange((long*)__x, (long)__y) argument
/external/libnl/include/
Dnetlink-local.h136 ({ type __x = (x); type __y = (y); __x < __y ? __x: __y; })
138 ({ type __x = (x); type __y = (y); __x > __y ? __x: __y; })

1234