Home
last modified time | relevance | path

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

1234

/NextBSD/contrib/libstdc++/src/
Dtree.cc73 _Rb_tree_node_base* __y = __x->_M_parent; in _GLIBCXX_BEGIN_NAMESPACE() local
74 while (__x == __y->_M_right) in _GLIBCXX_BEGIN_NAMESPACE()
76 __x = __y; in _GLIBCXX_BEGIN_NAMESPACE()
77 __y = __y->_M_parent; in _GLIBCXX_BEGIN_NAMESPACE()
79 if (__x->_M_right != __y) in _GLIBCXX_BEGIN_NAMESPACE()
80 __x = __y; in _GLIBCXX_BEGIN_NAMESPACE()
99 _Rb_tree_node_base* __y = __x->_M_left; in _Rb_tree_decrement() local
100 while (__y->_M_right != 0) in _Rb_tree_decrement()
101 __y = __y->_M_right; in _Rb_tree_decrement()
102 __x = __y; in _Rb_tree_decrement()
[all …]
Dlist.cc61 _List_node_base::swap(_List_node_base& __x, _List_node_base& __y) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
65 if ( __y._M_next != &__y ) 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()
71 __y._M_next->_M_prev = __y._M_prev->_M_next = &__y; 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()
78 __y._M_next->_M_prev = __y._M_prev->_M_next = &__y; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
82 else if ( __y._M_next != &__y ) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
85 __x._M_next = __y._M_next; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
/NextBSD/contrib/llvm/tools/clang/lib/Headers/
HDtgmath.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 …]
HDadxintrin.h37 _addcarryx_u32(unsigned char __cf, unsigned int __x, unsigned int __y, in _addcarryx_u32() argument
40 return __builtin_ia32_addcarryx_u32(__cf, __x, __y, __p); in _addcarryx_u32()
46 unsigned long long __y, unsigned long long *__p) in _addcarryx_u64() argument
48 return __builtin_ia32_addcarryx_u64(__cf, __x, __y, __p); in _addcarryx_u64()
55 _addcarry_u32(unsigned char __cf, unsigned int __x, unsigned int __y, in _addcarry_u32() argument
58 return __builtin_ia32_addcarry_u32(__cf, __x, __y, __p); in _addcarry_u32()
64 unsigned long long __y, unsigned long long *__p) in _addcarry_u64() argument
66 return __builtin_ia32_addcarry_u64(__cf, __x, __y, __p); in _addcarry_u64()
71 _subborrow_u32(unsigned char __cf, unsigned int __x, unsigned int __y, in _subborrow_u32() argument
74 return __builtin_ia32_subborrow_u32(__cf, __x, __y, __p); in _subborrow_u32()
[all …]
/NextBSD/contrib/libstdc++/include/bits/
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 …]
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 …]
Dvalarray_before.h193 _Tp operator()(const _Tp& __x, const _Tp& __y) const in operator()
194 { return __x + __y; } in operator()
200 _Tp operator()(const _Tp& __x, const _Tp& __y) const in operator()
201 { return __x - __y; } in operator()
207 _Tp operator()(const _Tp& __x, const _Tp& __y) const in operator()
208 { return __x * __y; } in operator()
214 _Tp operator()(const _Tp& __x, const _Tp& __y) const in operator()
215 { return __x / __y; } in operator()
221 _Tp operator()(const _Tp& __x, const _Tp& __y) const in operator()
222 { return __x % __y; } in operator()
[all …]
Dstl_deque.h124 _Deque_iterator(_Tp* __x, _Map_pointer __y) in _Deque_iterator()
125 : _M_cur(__x), _M_first(*__y), in _Deque_iterator()
126 _M_last(*__y + _S_buffer_size()), _M_node(__y) {} in _Deque_iterator()
244 const _Deque_iterator<_Tp, _Ref, _Ptr>& __y)
245 { return __x._M_cur == __y._M_cur; }
251 const _Deque_iterator<_Tp, _RefR, _PtrR>& __y)
252 { return __x._M_cur == __y._M_cur; }
257 const _Deque_iterator<_Tp, _Ref, _Ptr>& __y)
258 { return !(__x == __y); }
264 const _Deque_iterator<_Tp, _RefR, _PtrR>& __y)
[all …]
Dstl_stack.h214 operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
215 { return __x.c == __y.c; }
232 operator<(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
233 { return __x.c < __y.c; }
238 operator!=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
239 { return !(__x == __y); }
244 operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
245 { return __y < __x; }
250 operator<=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
251 { return !(__y < __x); }
[all …]
Dstl_relops.h92 operator!=(const _Tp& __x, const _Tp& __y) in _GLIBCXX_BEGIN_NAMESPACE()
93 { return !(__x == __y); } in _GLIBCXX_BEGIN_NAMESPACE()
105 operator>(const _Tp& __x, const _Tp& __y) in _GLIBCXX_BEGIN_NAMESPACE()
106 { return __y < __x; } in _GLIBCXX_BEGIN_NAMESPACE()
118 operator<=(const _Tp& __x, const _Tp& __y) in _GLIBCXX_BEGIN_NAMESPACE()
119 { return !(__y < __x); } in _GLIBCXX_BEGIN_NAMESPACE()
131 operator>=(const _Tp& __x, const _Tp& __y) in _GLIBCXX_BEGIN_NAMESPACE()
132 { return !(__x < __y); } in _GLIBCXX_BEGIN_NAMESPACE()
Dstl_iterator.h283 const reverse_iterator<_Iterator>& __y)
284 { return __x.base() == __y.base(); }
289 const reverse_iterator<_Iterator>& __y)
290 { return __y.base() < __x.base(); }
295 const reverse_iterator<_Iterator>& __y)
296 { return !(__x == __y); }
301 const reverse_iterator<_Iterator>& __y)
302 { return __y < __x; }
307 const reverse_iterator<_Iterator>& __y)
308 { return !(__y < __x); }
[all …]
Dstl_queue.h239 operator==(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
240 { return __x.c == __y.c; }
257 operator<(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
258 { return __x.c < __y.c; }
263 operator!=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
264 { return !(__x == __y); }
269 operator>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
270 { return __y < __x; }
275 operator<=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
276 { return !(__y < __x); }
[all …]
Dstl_tree.h301 const _Rb_tree_const_iterator<_Val>& __y)
302 { return __x._M_node == __y._M_node; }
307 const _Rb_tree_const_iterator<_Val>& __y)
308 { return __x._M_node != __y._M_node; }
569 _M_insert(_Base_ptr __x, _Base_ptr __y, const value_type& __v);
574 _M_insert_lower(_Base_ptr __x, _Base_ptr __y, const value_type& __v);
577 _M_insert(_Const_Base_ptr __x, _Const_Base_ptr __y,
772 const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
774 return __x.size() == __y.size()
775 && std::equal(__x.begin(), __x.end(), __y.begin());
[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()
613 const multimap<_Key, _Tp, _Compare, _Alloc>& __y)
614 { return __x._M_t == __y._M_t; }
630 const multimap<_Key, _Tp, _Compare, _Alloc>& __y)
631 { return __x._M_t < __y._M_t; }
637 const multimap<_Key, _Tp, _Compare, _Alloc>& __y)
638 { return !(__x == __y); }
644 const multimap<_Key, _Tp, _Compare, _Alloc>& __y)
645 { return __y < __x; }
[all …]
Dstl_set.h522 const set<_Key, _Compare, _Alloc>& __y)
523 { return __x._M_t == __y._M_t; }
539 const set<_Key, _Compare, _Alloc>& __y)
540 { return __x._M_t < __y._M_t; }
546 const set<_Key, _Compare, _Alloc>& __y)
547 { return !(__x == __y); }
553 const set<_Key, _Compare, _Alloc>& __y)
554 { return __y < __x; }
560 const set<_Key, _Compare, _Alloc>& __y)
561 { return !(__y < __x); }
[all …]
Dstl_multiset.h508 const multiset<_Key, _Compare, _Alloc>& __y)
509 { return __x._M_t == __y._M_t; }
525 const multiset<_Key, _Compare, _Alloc>& __y)
526 { return __x._M_t < __y._M_t; }
532 const multiset<_Key, _Compare, _Alloc>& __y)
533 { return !(__x == __y); }
539 const multiset<_Key,_Compare,_Alloc>& __y)
540 { return __y < __x; }
546 const multiset<_Key, _Compare, _Alloc>& __y)
547 { return !(__y < __x); }
[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()
683 const map<_Key, _Tp, _Compare, _Alloc>& __y)
684 { return __x._M_t == __y._M_t; }
700 const map<_Key, _Tp, _Compare, _Alloc>& __y)
701 { return __x._M_t < __y._M_t; }
707 const map<_Key, _Tp, _Compare, _Alloc>& __y)
708 { return !(__x == __y); }
714 const map<_Key, _Tp, _Compare, _Alloc>& __y)
715 { return __y < __x; }
[all …]
Dstl_list.h81 swap(_List_node_base& __x, _List_node_base& __y);
266 const _List_const_iterator<_Val>& __y)
267 { return __x._M_node == __y._M_node; }
272 const _List_const_iterator<_Val>& __y)
273 { return __x._M_node != __y._M_node; }
1207 operator==(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)
1211 const_iterator __end2 = __y.end();
1214 const_iterator __i2 = __y.begin();
1236 operator<(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)
1238 __y.begin(), __y.end()); }
[all …]
Dstl_vector.h953 operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
954 { return (__x.size() == __y.size()
955 && std::equal(__x.begin(), __x.end(), __y.begin())); }
970 operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
972 __y.begin(), __y.end()); }
977 operator!=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
978 { return !(__x == __y); }
983 operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
984 { return __y < __x; }
989 operator<=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
[all …]
/NextBSD/contrib/libstdc++/include/std/
Dstd_complex.h318 operator+(const complex<_Tp>& __x, const complex<_Tp>& __y)
321 __r += __y;
327 operator+(const complex<_Tp>& __x, const _Tp& __y)
330 __r.real() += __y;
336 operator+(const _Tp& __x, const complex<_Tp>& __y)
338 complex<_Tp> __r = __y;
348 operator-(const complex<_Tp>& __x, const complex<_Tp>& __y)
351 __r -= __y;
357 operator-(const complex<_Tp>& __x, const _Tp& __y)
360 __r.real() -= __y;
[all …]
/NextBSD/contrib/libc++/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 …]
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 …]
/NextBSD/contrib/libstdc++/include/tr1/
Dcmath379 atan2(_Tp __y, _Up __x)
382 return std::atan2(__type(__y), __type(__x));
424 copysign(float __x, float __y)
425 { return __builtin_copysignf(__x, __y); }
428 copysign(long double __x, long double __y)
429 { return __builtin_copysignl(__x, __y); }
433 copysign(_Tp __x, _Up __y)
436 return copysign(__type(__x), __type(__y));
511 fdim(float __x, float __y)
512 { return __builtin_fdimf(__x, __y); }
[all …]
/NextBSD/contrib/libstdc++/include/c_std/
Dcmath.tcc45 _Tp __y = __n % 2 ? __x : 1; in _GLIBCXX_BEGIN_NAMESPACE() local
51 __y = __y * __x; in _GLIBCXX_BEGIN_NAMESPACE()
54 return __y; in _GLIBCXX_BEGIN_NAMESPACE()

1234