Searched refs:__y (Results 1 - 25 of 44) sorted by relevance

12

/freebsd-11-stable/contrib/libstdc++/include/bits/
H A Dstl_relops.h92 operator!=(const _Tp& __x, const _Tp& __y) argument
93 { return !(__x == __y); }
105 operator>(const _Tp& __x, const _Tp& __y) argument
106 { return __y < __x; }
118 operator<=(const _Tp& __x, const _Tp& __y) argument
119 { return !(__y < __x); }
131 operator>=(const _Tp& __x, const _Tp& __y) argument
132 { return !(__x < __y); }
H A Dstl_pair.h96 operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument
97 { return __x.first == __y.first && __x.second == __y.second; }
102 operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument
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) argument
110 { return !(__x == __y); }
115 operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument
121 operator <=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument
127 operator >=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument
144 make_pair(_T1 __x, _T2 __y) argument
[all...]
H A Dstl_stack.h214 operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument
215 { return __x.c == __y.c; }
232 operator<(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument
233 { return __x.c < __y.c; }
238 operator!=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument
239 { return !(__x == __y); }
244 operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument
245 { return __y < __x; }
250 operator<=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument
251 { return !(__y < __
256 operator >=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument
[all...]
H A Dvalarray_before.h193 _Tp operator()(const _Tp& __x, const _Tp& __y) const
194 { return __x + __y; }
200 _Tp operator()(const _Tp& __x, const _Tp& __y) const
201 { return __x - __y; }
207 _Tp operator()(const _Tp& __x, const _Tp& __y) const
208 { return __x * __y; }
214 _Tp operator()(const _Tp& __x, const _Tp& __y) const
215 { return __x / __y; }
221 _Tp operator()(const _Tp& __x, const _Tp& __y) const
222 { return __x % __y; }
[all...]
H A Dstl_function.h137 operator()(const _Tp& __x, const _Tp& __y) const
138 { return __x + __y; }
146 operator()(const _Tp& __x, const _Tp& __y) const
147 { return __x - __y; }
155 operator()(const _Tp& __x, const _Tp& __y) const
156 { return __x * __y; }
164 operator()(const _Tp& __x, const _Tp& __y) const
165 { return __x / __y; }
173 operator()(const _Tp& __x, const _Tp& __y) const
174 { return __x % __y; }
400 binder1st(const _Operation& __x, const typename _Operation::first_argument_type& __y) argument
434 binder2nd(const _Operation& __x, const typename _Operation::second_argument_type& __y) argument
[all...]
H A Dstl_multimap.h121 bool operator()(const value_type& __x, const value_type& __y) const
122 { return comp(__x.first, __y.first); }
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 < __
612 operator ==(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) argument
629 operator <(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) argument
636 operator !=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) argument
643 operator >(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) argument
650 operator <=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) argument
657 operator >=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) argument
664 swap(multimap<_Key, _Tp, _Compare, _Alloc>& __x, multimap<_Key, _Tp, _Compare, _Alloc>& __y) argument
[all...]
H A Dstl_queue.h239 operator==(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) argument
240 { return __x.c == __y.c; }
257 operator<(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) argument
258 { return __x.c < __y.c; }
263 operator!=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) argument
264 { return !(__x == __y); }
269 operator>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) argument
270 { return __y < __x; }
275 operator<=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) argument
276 { return !(__y < __
281 operator >=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) argument
[all...]
H A 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 < __
282 operator ==(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument
288 operator <(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument
294 operator !=(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument
300 operator >(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument
306 operator <=(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument
312 operator >=(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument
318 operator -(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument
332 operator ==(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) argument
338 operator <(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) argument
344 operator !=(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) argument
350 operator >(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) argument
356 operator <=(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) argument
362 operator >=(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) argument
368 operator -(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) argument
[all...]
H A Dstl_deque.h124 _Deque_iterator(_Tp* __x, _Map_pointer __y) argument
125 : _M_cur(__x), _M_first(*__y),
126 _M_last(*__y + _S_buffer_size()), _M_node(__y) {}
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); }
243 operator ==(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) argument
250 operator ==(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) argument
256 operator !=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) argument
263 operator !=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) argument
269 operator <(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) argument
277 operator <(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) argument
284 operator >(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) argument
291 operator >(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) argument
297 operator <=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) argument
304 operator <=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) argument
310 operator >=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) argument
317 operator >=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) argument
327 operator -(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) argument
339 operator -(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) argument
1561 operator ==(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1579 operator <(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1587 operator !=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1594 operator >(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1601 operator <=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1608 operator >=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1615 swap(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>& __y) argument
[all...]
H A 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 < __
507 operator ==(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) argument
524 operator <(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) argument
531 operator !=(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) argument
538 operator >(const multiset<_Key,_Compare,_Alloc>& __x, const multiset<_Key,_Compare,_Alloc>& __y) argument
545 operator <=(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) argument
552 operator >=(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) argument
559 swap(multiset<_Key, _Compare, _Alloc>& __x, multiset<_Key, _Compare, _Alloc>& __y) argument
[all...]
H A 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 < __
521 operator ==(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) argument
538 operator <(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) argument
545 operator !=(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) argument
552 operator >(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) argument
559 operator <=(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) argument
566 operator >=(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) argument
573 swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>& __y) argument
[all...]
H A Dstl_map.h122 bool operator()(const value_type& __x, const value_type& __y) const
123 { return comp(__x.first, __y.first); }
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 < __
682 operator ==(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) argument
699 operator <(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) argument
706 operator !=(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) argument
713 operator >(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) argument
720 operator <=(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) argument
727 operator >=(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) argument
734 swap(map<_Key, _Tp, _Compare, _Alloc>& __x, map<_Key, _Tp, _Compare, _Alloc>& __y) argument
[all...]
H A 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
300 operator ==(const _Rb_tree_iterator<_Val>& __x, const _Rb_tree_const_iterator<_Val>& __y) argument
306 operator !=(const _Rb_tree_iterator<_Val>& __x, const _Rb_tree_const_iterator<_Val>& __y) argument
771 operator ==(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument
781 operator <(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument
791 operator !=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument
798 operator >(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument
805 operator <=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument
812 operator >=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument
819 swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument
907 _Link_type __y = _M_end(); local
924 _Link_type __y = _M_end(); local
992 _Link_type __y = _M_end(); local
1263 _Link_type __y = local
1277 _Link_type __y = local
1316 _Link_type __y = _M_clone_node(__x); local
1343 _Link_type __y = _S_left(__x); local
1392 _Link_type __y = _M_end(); // Last node which is not less than __k. local
1413 _Const_Link_type __y = _M_end(); // Last node which is not less than __k. local
1446 _Link_type __y = _M_end(); // Last node which is not less than __k. local
1464 _Const_Link_type __y = _M_end(); // Last node which is not less than __k. local
1482 _Link_type __y = _M_end(); // Last node which is greater than __k. local
1500 _Const_Link_type __y = _M_end(); // Last node which is greater than __k. local
[all...]
H A 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) argument
1211 const_iterator __end2 = __y.end();
1214 const_iterator __i2 = __y.begin();
1236 operator<(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument
1238 __y
265 operator ==(const _List_iterator<_Val>& __x, const _List_const_iterator<_Val>& __y) argument
271 operator !=(const _List_iterator<_Val>& __x, const _List_const_iterator<_Val>& __y) argument
1243 operator !=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument
1249 operator >(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument
1255 operator <=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument
1261 operator >=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument
1267 swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y) argument
[all...]
H A Dstl_vector.h953 operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument
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) argument
972 __y.begin(), __y.end()); }
977 operator!=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument
978 { return !(__x == __y); }
983 operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument
984 { return __y < __
989 operator <=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument
995 operator >=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument
1001 swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y) argument
[all...]
H A Dstream_iterator.h129 const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y)
130 { return __x._M_equal(__y); }
136 const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y)
137 { return !__x._M_equal(__y); }
128 operator ==(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) argument
135 operator !=(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) argument
/freebsd-11-stable/contrib/libstdc++/src/
H A Dlist.cc61 _List_node_base::swap(_List_node_base& __x, _List_node_base& __y) argument
65 if ( __y._M_next != &__y )
67 // Both __x and __y are not empty.
68 std::swap(__x._M_next,__y._M_next);
69 std::swap(__x._M_prev,__y._M_prev);
71 __y._M_next->_M_prev = __y._M_prev->_M_next = &__y;
75 // __x is not empty, __y i
[all...]
H A Dtree.cc73 _Rb_tree_node_base* __y = __x->_M_parent; local
74 while (__x == __y->_M_right)
76 __x = __y;
77 __y = __y->_M_parent;
79 if (__x->_M_right != __y)
80 __x = __y;
99 _Rb_tree_node_base* __y = __x->_M_left; local
100 while (__y->_M_right != 0)
101 __y
106 _Rb_tree_node_base* __y = __x->_M_parent; local
127 _Rb_tree_node_base* const __y = __x->_M_right; local
148 _Rb_tree_node_base* const __y = __x->_M_left; local
210 _Rb_tree_node_base* const __y = __xpp->_M_right; local
232 _Rb_tree_node_base* const __y = __xpp->_M_left; local
263 _Rb_tree_node_base* __y = __z; local
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/lib/Headers/
H A Dadxintrin.h22 _addcarryx_u32(unsigned char __cf, unsigned int __x, unsigned int __y, argument
25 return __builtin_ia32_addcarryx_u32(__cf, __x, __y, __p);
31 unsigned long long __y, unsigned long long *__p)
33 return __builtin_ia32_addcarryx_u64(__cf, __x, __y, __p);
39 _addcarry_u32(unsigned char __cf, unsigned int __x, unsigned int __y, argument
42 return __builtin_ia32_addcarryx_u32(__cf, __x, __y, __p);
48 unsigned long long __y, unsigned long long *__p)
50 return __builtin_ia32_addcarryx_u64(__cf, __x, __y, __p);
55 _subborrow_u32(unsigned char __cf, unsigned int __x, unsigned int __y, argument
58 return __builtin_ia32_subborrow_u32(__cf, __x, __y, __
30 _addcarryx_u64(unsigned char __cf, unsigned long long __x, unsigned long long __y, unsigned long long *__p) argument
47 _addcarry_u64(unsigned char __cf, unsigned long long __x, unsigned long long __y, unsigned long long *__p) argument
63 _subborrow_u64(unsigned char __cf, unsigned long long __x, unsigned long long __y, unsigned long long *__p) argument
[all...]
H A Dtgmath.h50 #define __tg_promote2(__x, __y) (__typeof__(__tg_promote(__x) + \
51 __tg_promote(__y)))
52 #define __tg_promote3(__x, __y, __z) (__typeof__(__tg_promote(__x) + \
53 __tg_promote(__y) + \
466 __tg_pow(float __x, float __y) {return powf(__x, __y);} argument
470 __tg_pow(double __x, double __y) {return pow(__x, __y);} argument
474 __tg_pow(long double __x, long double __y) {return powl(__x, __y);} argument
478 __tg_pow(float _Complex __x, float _Complex __y) argument
482 __tg_pow(double _Complex __x, double _Complex __y) argument
486 __tg_pow(long double _Complex __x, long double _Complex __y) argument
555 __tg_atan2(float __x, float __y) argument
559 __tg_atan2(double __x, double __y) argument
563 __tg_atan2(long double __x, long double __y) argument
607 __tg_copysign(float __x, float __y) argument
611 __tg_copysign(double __x, double __y) argument
615 __tg_copysign(long double __x, long double __y) argument
693 __tg_fdim(float __x, float __y) argument
697 __tg_fdim(double __x, double __y) argument
701 __tg_fdim(long double __x, long double __y) argument
728 __tg_fma(float __x, float __y, float __z) argument
733 __tg_fma(double __x, double __y, double __z) argument
738 __tg_fma(long double __x,long double __y, long double __z) argument
751 __tg_fmax(float __x, float __y) argument
755 __tg_fmax(double __x, double __y) argument
759 __tg_fmax(long double __x, long double __y) argument
769 __tg_fmin(float __x, float __y) argument
773 __tg_fmin(double __x, double __y) argument
777 __tg_fmin(long double __x, long double __y) argument
787 __tg_fmod(float __x, float __y) argument
791 __tg_fmod(double __x, double __y) argument
795 __tg_fmod(long double __x, long double __y) argument
805 __tg_frexp(float __x, int* __y) argument
809 __tg_frexp(double __x, int* __y) argument
813 __tg_frexp(long double __x, int* __y) argument
822 __tg_hypot(float __x, float __y) argument
826 __tg_hypot(double __x, double __y) argument
830 __tg_hypot(long double __x, long double __y) argument
857 __tg_ldexp(float __x, int __y) argument
861 __tg_ldexp(double __x, int __y) argument
865 __tg_ldexp(long double __x, int __y) argument
1044 __tg_nextafter(float __x, float __y) argument
1048 __tg_nextafter(double __x, double __y) argument
1052 __tg_nextafter(long double __x, long double __y) argument
1062 __tg_nexttoward(float __x, long double __y) argument
1066 __tg_nexttoward(double __x, long double __y) argument
1070 __tg_nexttoward(long double __x, long double __y) argument
1079 __tg_remainder(float __x, float __y) argument
1083 __tg_remainder(double __x, double __y) argument
1087 __tg_remainder(long double __x, long double __y) argument
1097 __tg_remquo(float __x, float __y, int* __z) argument
1102 __tg_remquo(double __x, double __y, int* __z) argument
1107 __tg_remquo(long double __x,long double __y, int* __z) argument
1154 __tg_scalbn(float __x, int __y) argument
1158 __tg_scalbn(double __x, int __y) argument
1162 __tg_scalbn(long double __x, int __y) argument
1171 __tg_scalbln(float __x, long __y) argument
1175 __tg_scalbln(double __x, long __y) argument
1179 __tg_scalbln(long double __x, long __y) argument
[all...]
H A Dammintrin.h48 /// \a __y.
56 /// \param __y
66 _mm_extract_si64(__m128i __x, __m128i __y) argument
68 return (__m128i)__builtin_ia32_extrq((__v2di)__x, (__v16qi)__y);
110 /// \a __y into the lower 64 bits of the destination integer vector \a __x
111 /// at the index and of the length specified by \a __y.
120 /// specified by operand \a __y.
121 /// \param __y
123 /// bits are the least significant bits of operand \a __y with length
128 /// length and index are both zero, bits [63:0] of parameter \a __y ar
136 _mm_insert_si64(__m128i __x, __m128i __y) argument
[all...]
H A D__clang_cuda_cmath.h62 __DEVICE__ float atan2(float __x, float __y) { return ::atan2f(__x, __y); } argument
69 __DEVICE__ float fmod(float __x, float __y) { return ::fmodf(__x, __y); } argument
99 __DEVICE__ bool isgreater(float __x, float __y) { argument
100 return __builtin_isgreater(__x, __y);
102 __DEVICE__ bool isgreater(double __x, double __y) { argument
103 return __builtin_isgreater(__x, __y);
105 __DEVICE__ bool isgreaterequal(float __x, float __y) { argument
106 return __builtin_isgreaterequal(__x, __y);
108 isgreaterequal(double __x, double __y) argument
111 isless(float __x, float __y) argument
114 isless(double __x, double __y) argument
117 islessequal(float __x, float __y) argument
120 islessequal(double __x, double __y) argument
123 islessgreater(float __x, float __y) argument
126 islessgreater(double __x, double __y) argument
131 isunordered(float __x, float __y) argument
134 isunordered(double __x, double __y) argument
284 fma(__T1 __x, __T2 __y, __T3 __z) argument
307 remquo(__T1 __x, __T2 __y, int *__quo) argument
[all...]
/freebsd-11-stable/contrib/libstdc++/include/std/
H A Dstd_complex.h318 operator+(const complex<_Tp>& __x, const complex<_Tp>& __y) argument
321 __r += __y;
327 operator+(const complex<_Tp>& __x, const _Tp& __y) argument
330 __r.real() += __y;
336 operator+(const _Tp& __x, const complex<_Tp>& __y) argument
338 complex<_Tp> __r = __y;
348 operator-(const complex<_Tp>& __x, const complex<_Tp>& __y) argument
351 __r -= __y;
357 operator-(const complex<_Tp>& __x, const _Tp& __y) argument
360 __r.real() -= __y;
366 operator -(const _Tp& __x, const complex<_Tp>& __y) argument
378 operator *(const complex<_Tp>& __x, const complex<_Tp>& __y) argument
387 operator *(const complex<_Tp>& __x, const _Tp& __y) argument
396 operator *(const _Tp& __x, const complex<_Tp>& __y) argument
408 operator /(const complex<_Tp>& __x, const complex<_Tp>& __y) argument
417 operator /(const complex<_Tp>& __x, const _Tp& __y) argument
426 operator /(const _Tp& __x, const complex<_Tp>& __y) argument
450 operator ==(const complex<_Tp>& __x, const complex<_Tp>& __y) argument
455 operator ==(const complex<_Tp>& __x, const _Tp& __y) argument
460 operator ==(const _Tp& __x, const complex<_Tp>& __y) argument
468 operator !=(const complex<_Tp>& __x, const complex<_Tp>& __y) argument
473 operator !=(const complex<_Tp>& __x, const _Tp& __y) argument
478 operator !=(const _Tp& __x, const complex<_Tp>& __y) argument
555 _Tp __y = __z.imag(); local
623 const _Tp __y = __z.imag(); local
665 const _Tp __y = __z.imag(); local
695 const _Tp __y = __z.imag(); local
783 const _Tp __y = __z.imag(); local
813 const _Tp __y = __z.imag(); local
844 _Tp __y = __z.imag(); local
947 pow(const complex<_Tp>& __x, const _Tp& __y) argument
962 __complex_pow(const complex<_Tp>& __x, const complex<_Tp>& __y) argument
967 __complex_pow(__complex__ float __x, __complex__ float __y) argument
971 __complex_pow(__complex__ double __x, __complex__ double __y) argument
975 __complex_pow(const __complex__ long double& __x, const __complex__ long double& __y) argument
981 pow(const complex<_Tp>& __x, const complex<_Tp>& __y) argument
986 pow(const complex<_Tp>& __x, const complex<_Tp>& __y) argument
992 pow(const _Tp& __x, const complex<_Tp>& __y) argument
[all...]
/freebsd-11-stable/contrib/libstdc++/include/c_std/
H A Dstd_cmath.h151 atan2(float __y, float __x) argument
152 { return __builtin_atan2f(__y, __x); }
155 atan2(long double __y, long double __x) argument
156 { return __builtin_atan2l(__y, __x); }
162 atan2(_Tp __y, _Up __x) argument
163 { return __builtin_atan2(__y, __x); }
264 fmod(float __x, float __y) argument
265 { return __builtin_fmodf(__x, __y); }
268 fmod(long double __x, long double __y) argument
269 { return __builtin_fmodl(__x, __y); }
357 pow(float __x, float __y) argument
361 pow(long double __x, long double __y) argument
[all...]
/freebsd-11-stable/contrib/libstdc++/include/debug/
H A Dhash_map.h265 const hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __y)
266 { return __x._M_base() == __y._M_base(); }
272 const hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __y)
273 { return __x._M_base() != __y._M_base(); }
279 hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __y)
280 { __x.swap(__y); }
264 operator ==(const hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __x, const hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __y) argument
271 operator !=(const hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __x, const hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __y) argument
278 swap(hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __x, hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __y) argument

Completed in 427 milliseconds

12