Searched refs:__x (Results 1 - 25 of 48) sorted by relevance

12

/haiku/src/system/libroot/posix/glibc/math/
H A Dmath-barriers.h33 ({ __typeof (x) __x = (x); __asm ("" : "+m" (__x)); __x; })
35 ({ __typeof (x) __x = (x); __asm __volatile__ ("" : : "m" (__x)); })
/haiku/src/system/libnetwork/netresolv/include/
H A Dnamespace.h6 #define __arraycount(__x) (sizeof(__x) / sizeof(__x[0]))
/haiku/headers/cpp/
H A Dstl_hash_fun.h60 size_t operator()(char __x) const { return __x; }
63 size_t operator()(unsigned char __x) const { return __x; }
66 size_t operator()(unsigned char __x) const { return __x; }
69 size_t operator()(short __x) const { return __x; }
72 size_t operator()(unsigned short __x) const { return __x; }
[all...]
H A Dstl_relops.h37 inline bool operator!=(const _Tp& __x, const _Tp& __y) { argument
38 return !(__x == __y);
42 inline bool operator>(const _Tp& __x, const _Tp& __y) { argument
43 return __y < __x;
47 inline bool operator<=(const _Tp& __x, const _Tp& __y) { argument
48 return !(__y < __x);
52 inline bool operator>=(const _Tp& __x, const _Tp& __y) { argument
53 return !(__x < __y);
H A Dstl_tree.h81 static _Base_ptr _S_minimum(_Base_ptr __x) argument
83 while (__x->_M_left != 0) __x = __x->_M_left;
84 return __x;
87 static _Base_ptr _S_maximum(_Base_ptr __x) argument
89 while (__x->_M_right != 0) __x = __x->_M_right;
90 return __x;
164 _Rb_tree_iterator(_Link_type __x) argument
187 operator ==(const _Rb_tree_base_iterator& __x, const _Rb_tree_base_iterator& __y) argument
192 operator !=(const _Rb_tree_base_iterator& __x, const _Rb_tree_base_iterator& __y) argument
217 _Rb_tree_rotate_left(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument
236 _Rb_tree_rotate_right(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument
255 _Rb_tree_rebalance(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument
306 _Rb_tree_node_base* __x = 0; local
552 _M_create_node(const value_type& __x) argument
562 _M_clone_node(_Link_type __x) argument
588 _S_left(_Link_type __x) argument
590 _S_right(_Link_type __x) argument
592 _S_parent(_Link_type __x) argument
594 _S_value(_Link_type __x) argument
596 _S_key(_Link_type __x) argument
598 _S_color(_Link_type __x) argument
601 _S_left(_Base_ptr __x) argument
603 _S_right(_Base_ptr __x) argument
605 _S_parent(_Base_ptr __x) argument
607 _S_value(_Base_ptr __x) argument
609 _S_key(_Base_ptr __x) argument
611 _S_color(_Base_ptr __x) argument
614 _S_minimum(_Link_type __x) argument
617 _S_maximum(_Link_type __x) argument
656 _Rb_tree(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x) argument
762 operator ==(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x, const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y) argument
772 operator <(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x, const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y) argument
784 swap(_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x, _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y) argument
797 operator =(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x) argument
825 _Link_type __x = (_Link_type) __x_; local
862 _Link_type __x = _M_root(); local
880 _Link_type __x = _M_root(); local
1040 erase(const _Key& __x) argument
1052 _M_copy(_Link_type __x, _Link_type __p) argument
1082 _M_erase(_Link_type __x) argument
1118 _Link_type __x = _M_root(); // Current node. local
1137 _Link_type __x = _M_root(); /* Current node. */ local
1169 _Link_type __x = _M_root(); /* Current node. */ local
1187 _Link_type __x = _M_root(); /* Current node. */ local
1205 _Link_type __x = _M_root(); /* Current node. */ local
1223 _Link_type __x = _M_root(); /* Current node. */ local
1280 _Link_type __x = (_Link_type) __it._M_node; local
[all...]
H A Dstl_pair.h53 inline bool operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument
55 return __x.first == __y.first && __x.second == __y.second;
59 inline bool operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument
61 return __x.first < __y.first ||
62 (!(__y.first < __x.first) && __x.second < __y.second);
66 inline pair<_T1, _T2> make_pair(const _T1& __x, const _T2& __y) argument
68 return pair<_T1, _T2>(__x, __y);
H A Dstl_stack.h61 void push(const value_type& __x) { _M_c.push_back(__x); } argument
66 bool operator==(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument
68 return __x._M_c == __y._M_c;
72 bool operator<(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument
74 return __x._M_c < __y._M_c;
80 bool operator!=(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument
82 return !(__x == __y);
86 bool operator>(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument
88 return __y < __x;
92 operator <=(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument
98 operator >=(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument
[all...]
H A Dstl_map.h66 bool operator()(const value_type& __x, const value_type& __y) const { argument
67 return _M_comp(__x.first, __y.first);
125 map(const map<_Key,_Tp,_Compare,_Alloc>& __x) : _M_t(__x._M_t) {} argument
127 operator=(const map<_Key, _Tp, _Compare, _Alloc>& __x) argument
129 _M_t = __x._M_t;
157 void swap(map<_Key,_Tp,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); } argument
161 pair<iterator,bool> insert(const value_type& __x) argument
162 { return _M_t.insert_unique(__x); }
163 insert(iterator position, const value_type& __x) argument
180 erase(const key_type& __x) argument
187 find(const key_type& __x) argument
190 lower_bound(const key_type& __x) argument
194 upper_bound(const key_type& __x) argument
199 equal_range(const key_type& __x) argument
210 operator ==(const map<_Key,_Tp,_Compare,_Alloc>& __x, const map<_Key,_Tp,_Compare,_Alloc>& __y) argument
216 operator <(const map<_Key,_Tp,_Compare,_Alloc>& __x, const map<_Key,_Tp,_Compare,_Alloc>& __y) argument
224 swap(map<_Key,_Tp,_Compare,_Alloc>& __x, map<_Key,_Tp,_Compare,_Alloc>& __y) argument
[all...]
H A Dstl_multimap.h65 bool operator()(const value_type& __x, const value_type& __y) const { argument
66 return _M_comp(__x.first, __y.first);
123 multimap(const multimap<_Key,_Tp,_Compare,_Alloc>& __x) : _M_t(__x._M_t) { } argument
125 operator=(const multimap<_Key,_Tp,_Compare,_Alloc>& __x) { argument
126 _M_t = __x._M_t;
147 void swap(multimap<_Key,_Tp,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); } argument
151 iterator insert(const value_type& __x) { return _M_t.insert_equal(__x); } argument
152 insert(iterator __position, const value_type& __x) argument
169 erase(const key_type& __x) argument
176 find(const key_type& __x) argument
179 lower_bound(const key_type& __x) argument
183 upper_bound(const key_type& __x) argument
187 equal_range(const key_type& __x) argument
200 operator ==(const multimap<_Key,_Tp,_Compare,_Alloc>& __x, const multimap<_Key,_Tp,_Compare,_Alloc>& __y) argument
206 operator <(const multimap<_Key,_Tp,_Compare,_Alloc>& __x, const multimap<_Key,_Tp,_Compare,_Alloc>& __y) argument
214 swap(multimap<_Key,_Tp,_Compare,_Alloc>& __x, multimap<_Key,_Tp,_Compare,_Alloc>& __y) argument
[all...]
H A Dstl_multiset.h115 multiset(const multiset<_Key,_Compare,_Alloc>& __x) : _M_t(__x._M_t) {} argument
117 operator=(const multiset<_Key,_Compare,_Alloc>& __x) { argument
118 _M_t = __x._M_t;
135 void swap(multiset<_Key,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); } argument
138 iterator insert(const value_type& __x) { argument
139 return _M_t.insert_equal(__x);
141 iterator insert(iterator __position, const value_type& __x) { argument
143 return _M_t.insert_equal((_Rep_iterator&)__position, __x);
163 erase(const key_type& __x) argument
192 operator ==(const multiset<_Key,_Compare,_Alloc>& __x, const multiset<_Key,_Compare,_Alloc>& __y) argument
198 operator <(const multiset<_Key,_Compare,_Alloc>& __x, const multiset<_Key,_Compare,_Alloc>& __y) argument
206 swap(multiset<_Key,_Compare,_Alloc>& __x, multiset<_Key,_Compare,_Alloc>& __y) argument
[all...]
H A Dstl_queue.h63 void push(const value_type& __x) { c.push_back(__x); } argument
69 operator==(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument
71 return __x.c == __y.c;
76 operator<(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument
78 return __x.c < __y.c;
85 operator!=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument
87 return !(__x == __y);
92 operator>(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument
94 return __y < __x;
99 operator <=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument
106 operator >=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument
132 priority_queue(const _Compare& __x) argument
133 priority_queue(const _Compare& __x, const _Sequence& __s) argument
143 priority_queue(_InputIterator __first, _InputIterator __last, const _Compare& __x) argument
149 priority_queue(_InputIterator __first, _InputIterator __last, const _Compare& __x, const _Sequence& __s) argument
161 priority_queue(const value_type* __first, const value_type* __last, const _Compare& __x) argument
166 priority_queue(const value_type* __first, const value_type* __last, const _Compare& __x, const _Sequence& __c) argument
178 push(const value_type& __x) argument
[all...]
H A Dstl_set.h109 set(const set<_Key,_Compare,_Alloc>& __x) : _M_t(__x._M_t) {} argument
110 set<_Key,_Compare,_Alloc>& operator=(const set<_Key, _Compare, _Alloc>& __x) argument
112 _M_t = __x._M_t;
129 void swap(set<_Key,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); } argument
132 pair<iterator,bool> insert(const value_type& __x) { argument
133 pair<typename _Rep_type::iterator, bool> __p = _M_t.insert_unique(__x);
136 iterator insert(iterator __position, const value_type& __x) { argument
138 return _M_t.insert_unique((_Rep_iterator&)__position, __x);
157 erase(const key_type& __x) argument
184 operator ==(const set<_Key,_Compare,_Alloc>& __x, const set<_Key,_Compare,_Alloc>& __y) argument
190 operator <(const set<_Key,_Compare,_Alloc>& __x, const set<_Key,_Compare,_Alloc>& __y) argument
198 swap(set<_Key,_Compare,_Alloc>& __x, set<_Key,_Compare,_Alloc>& __y) argument
[all...]
H A Dstl_function.h51 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x + __y; } argument
56 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x - __y; } argument
61 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x * __y; } argument
66 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x / __y; } argument
81 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x argument
93 operator ()(const _Tp& __x, const _Tp& __y) const argument
99 operator ()(const _Tp& __x, const _Tp& __y) const argument
105 operator ()(const _Tp& __x, const _Tp& __y) const argument
111 operator ()(const _Tp& __x, const _Tp& __y) const argument
117 operator ()(const _Tp& __x, const _Tp& __y) const argument
123 operator ()(const _Tp& __x, const _Tp& __y) const argument
129 operator ()(const _Tp& __x, const _Tp& __y) const argument
135 operator ()(const _Tp& __x, const _Tp& __y) const argument
150 unary_negate(const _Predicate& __x) argument
171 binary_negate(const _Predicate& __x) argument
172 operator ()(const typename _Predicate::first_argument_type& __x, const typename _Predicate::second_argument_type& __y) const argument
194 binder1st(const _Operation& __x, const typename _Operation::first_argument_type& __y) argument
205 bind1st(const _Operation& __oper, const _Tp& __x) argument
219 binder2nd(const _Operation& __x, const typename _Operation::second_argument_type& __y) argument
230 bind2nd(const _Operation& __oper, const _Tp& __x) argument
247 unary_compose(const _Operation1& __x, const _Operation2& __y) argument
271 binary_compose(const _Operation1& __x, const _Operation2& __y, const _Operation3& __z) argument
295 pointer_to_unary_function(_Result (__x)_Arg)) argument
300 ptr_fun(_Result (__x)_Arg)) argument
312 pointer_to_binary_function(_Result (__x)_Arg1, _Arg2)) argument
314 operator ()(_Arg1 __x, _Arg2 __y) const argument
321 ptr_fun(_Result (__x)_Arg1, _Arg2)) argument
355 operator ()(const _Arg1& __x, const _Arg2&) const argument
[all...]
/haiku/src/system/libroot/posix/glibc/math/bits/
H A Dmathcalls.h54 __MATHCALL (acos,, (_Mdouble_ __x));
56 __MATHCALL (asin,, (_Mdouble_ __x));
58 __MATHCALL (atan,, (_Mdouble_ __x));
60 __MATHCALL (atan2,, (_Mdouble_ __y, _Mdouble_ __x));
63 __MATHCALL (cos,, (_Mdouble_ __x));
65 __MATHCALL (sin,, (_Mdouble_ __x));
67 __MATHCALL (tan,, (_Mdouble_ __x));
72 (_Mdouble_ __x, _Mdouble_ *__sinx, _Mdouble_ *__cosx));
78 __MATHCALL (cosh,, (_Mdouble_ __x));
80 __MATHCALL (sinh,, (_Mdouble_ __x));
[all...]
/haiku/src/system/libroot/posix/glibc/stdlib/
H A Dseed48_r.c30 memcpy (buffer->__old_x, buffer->__x, sizeof (buffer->__x));
33 buffer->__x[2] = seed16v[2];
34 buffer->__x[1] = seed16v[1];
35 buffer->__x[0] = seed16v[0];
H A Dsrand48_r.c32 buffer->__x[2] = seedval >> 16;
33 buffer->__x[1] = seedval & 0xffffl;
34 buffer->__x[0] = 0x330e;
H A Ddrand48.c30 (void) __erand48_r (__libc_drand48_data.__x, &__libc_drand48_data, &result);
H A Dlrand48.c30 (void) __nrand48_r (__libc_drand48_data.__x, &__libc_drand48_data, &result);
H A Dmrand48.c30 (void) __jrand48_r (__libc_drand48_data.__x, &__libc_drand48_data, &result);
H A Ddrand48_r.c29 return __erand48_r (buffer->__x, buffer, result);
H A Dlrand48_r.c31 return __nrand48_r (buffer->__x, buffer, result);
H A Dmrand48_r.c31 return __jrand48_r (buffer->__x, buffer, result);
H A Dlcong48_r.c31 memcpy (buffer->__x, &param[0], sizeof (buffer->__x));
/haiku/src/add-ons/kernel/drivers/network/wlan/broadcom43xx/dev/bwi/
H A Dbitops.h79 #define __SHIFTOUT(__x, __mask) (((__x) & (__mask)) / __LOWEST_SET_BIT(__mask))
80 #define __SHIFTIN(__x, __mask) ((__x) * __LOWEST_SET_BIT(__mask))
/haiku/src/system/libroot/posix/glibc/include/arch/m68k/
H A Dmathimpl.h37 __m81_defun (double, __ieee754_remainder, (double __x, double __y)) argument
40 __asm ("frem%.x %1, %0" : "=f" (__result) : "f" (__y), "0" (__x));
44 __m81_defun (float, __ieee754_remainderf, (float __x, float __y)) argument
47 __asm ("frem%.x %1, %0" : "=f" (__result) : "f" (__y), "0" (__x));
52 __ieee754_remainderl, (long double __x, long double __y))
55 __asm ("frem%.x %1, %0" : "=f" (__result) : "f" (__y), "0" (__x));
59 __m81_defun (double, __ieee754_fmod, (double __x, double __y)) argument
62 __asm ("fmod%.x %1, %0" : "=f" (__result) : "f" (__y), "0" (__x));
66 __m81_defun (float, __ieee754_fmodf, (float __x, float __y)) argument
69 __asm ("fmod%.x %1, %0" : "=f" (__result) : "f" (__y), "0" (__x));
51 __m81_defun(long double, __ieee754_remainderl, (long double __x, long double __y)) argument
73 __m81_defun(long double, __ieee754_fmodl, (long double __x, long double __y)) argument
[all...]

Completed in 148 milliseconds

12