/haiku-fatelf/headers/cpp/ |
H A D | stl_hash_fun.h | 60 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 D | stl_relops.h | 37 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 D | stl_tree.h | 81 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 D | stl_pair.h | 53 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 D | stl_stack.h | 61 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 D | stl_map.h | 66 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 D | stl_multimap.h | 65 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 D | stl_multiset.h | 115 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 D | stl_queue.h | 63 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 D | stl_set.h | 109 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...] |
/haiku-fatelf/src/system/libroot/posix/glibc/math/bits/ |
H A D | mathcalls.h | 54 __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-fatelf/src/system/libroot/posix/glibc/arch/x86_64/ |
H A D | math_private.h | 4 ({ __typeof(x) __x; \ 6 __asm ("" : "=x" (__x) : "0" (x)); \ 8 __asm ("" : "=t" (__x) : "0" (x)); \ 9 __x; })
|
/haiku-fatelf/src/system/libroot/posix/glibc/include/arch/x86_64/bits/ |
H A D | byteswap.h | 36 ({ register unsigned short int __v, __x = (x); \ 37 if (__builtin_constant_p (__x)) \ 38 __v = __bswap_constant_16 (__x); \ 42 : "0" (__x) \ 49 ({ register unsigned short int __x = (x); __bswap_constant_16 (__x); })) 67 ({ register unsigned int __v, __x = (x); \ 68 if (__builtin_constant_p (__x)) \ 69 __v = __bswap_constant_32 (__x); \ 71 __asm__ ("bswap %0" : "=r" (__v) : "0" (__x)); \ [all...] |
H A D | mathinline.h | 129 __signbitf (float __x) argument 133 __asm ("pmovmskb %1, %0" : "=r" (__m) : "x" (__x)); 136 __extension__ union { float __f; int __i; } __u = { __f: __x }; 141 __signbit (double __x) argument 145 __asm ("pmovmskb %1, %0" : "=r" (__m) : "x" (__x)); 148 __extension__ union { double __d; int __i[2]; } __u = { __d: __x }; 153 __signbitl (long double __x) argument 155 __extension__ union { long double __l; int __i[3]; } __u = { __l: __x }; 178 __NTH (lrintf (float __x)) argument 185 __asm __volatile__ ("cvtss2si %1, %0" : "=r" (__res) : "xm" (__x)); 191 lrint(double __x) argument 204 llrintf(float __x) argument 215 llrint(double __x) argument 231 fmaxf(float __x, float __y) argument 243 fmax(double __x, double __y) argument 257 fminf(float __x, float __y) argument 269 fmin(double __x, double __y) argument 291 rint(double __x) argument 302 rintf(float __x) argument 316 nearbyint(double __x) argument 327 nearbyintf(float __x) argument 345 ceil(double __x) argument 355 ceilf(float __x) argument 366 floor(double __x) argument 376 floorf(float __x) argument 557 __sincos(double __x, double *__sinx, double *__cosx) argument 563 __sincosf(float __x, float *__sinx, float *__cosx) argument 569 __sincosl(long double __x, long double *__sinx, long double *__cosx) argument 788 ldexp(double __x, int __y) argument 858 ldexpf(float __x, int __y) argument 864 ldexpl(long double __x, int __y) argument 879 lrintf(float __x) argument 884 lrint(double __x) argument 889 lrintl(long double __x) argument 902 llrintf(float __x) argument 907 llrint(double __x) argument 912 llrintl(long double __x) argument 939 __finite(double __x) argument [all...] |
/haiku-fatelf/src/system/libroot/posix/glibc/stdlib/ |
H A D | seed48_r.c | 30 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 D | srand48_r.c | 32 buffer->__x[2] = seedval >> 16; 33 buffer->__x[1] = seedval & 0xffffl; 34 buffer->__x[0] = 0x330e;
|
H A D | drand48.c | 30 (void) __erand48_r (__libc_drand48_data.__x, &__libc_drand48_data, &result);
|
H A D | lrand48.c | 30 (void) __nrand48_r (__libc_drand48_data.__x, &__libc_drand48_data, &result);
|
H A D | mrand48.c | 30 (void) __jrand48_r (__libc_drand48_data.__x, &__libc_drand48_data, &result);
|
/haiku-fatelf/src/add-ons/kernel/drivers/network/wlan/broadcom43xx/dev/bwi/ |
H A D | bitops.h | 77 #define __SHIFTOUT(__x, __mask) (((__x) & (__mask)) / __LOWEST_SET_BIT(__mask)) 78 #define __SHIFTIN(__x, __mask) ((__x) * __LOWEST_SET_BIT(__mask))
|
/haiku-fatelf/src/system/libroot/posix/glibc/include/arch/ppc/bits/ |
H A D | mathinline.h | 36 ({ __typeof__(x) __x = (x); __typeof__(y) __y = (y); \ 38 __asm__("fcmpu 7,%1,%2 ; mfcr %0" : "=r" (__r) : "f" (__x), "f"(__y) \ 61 __MATH_INLINE long int lrint (double __x) __THROW; 63 lrint (double __x) __THROW 69 __asm__ ("fctiw %0,%1" : "=f"(__u.__d) : "f"(__x)); 73 __MATH_INLINE long int lrintf (float __x) __THROW; 75 lrintf (float __x) __THROW 81 __asm__ ("fctiw %0,%1" : "=f"(__u.__d) : "f"(__x)); 85 __MATH_INLINE double fdim (double __x, double __y) __THROW; 87 fdim (double __x, doubl [all...] |
/haiku-fatelf/src/system/libroot/posix/glibc/include/arch/x86/bits/ |
H A D | byteswap.h | 35 ({ register unsigned short int __v, __x = (x); \ 36 if (__builtin_constant_p (__x)) \ 37 __v = __bswap_constant_16 (__x); \ 41 : "0" (__x) \ 48 ({ register unsigned short int __x = (x); __bswap_constant_16 (__x); })) 71 ({ register unsigned int __v, __x = (x); \ 72 if (__builtin_constant_p (__x)) \ 73 __v = __bswap_constant_32 (__x); \ 79 : "0" (__x) \ [all...] |
H A D | mathinline.h | 128 __signbitf (float __x) __THROW 130 __extension__ union { float __f; int __i; } __u = { __f: __x }; 134 __signbit (double __x) __THROW 136 __extension__ union { double __d; int __i[2]; } __u = { __d: __x }; 140 __signbitl (long double __x) __THROW 142 __extension__ union { long double __l; int __i[3]; } __u = { __l: __x }; 180 __inline_mathop_decl_ (float_type, func, op, "0" (__x)) 182 __inline_mathop_declNP_ (float_type, func, op, "0" (__x)) 206 __MATH_INLINE float_type func (float_type __x) __THROW \ 291 __inline_mathcode (__sgn, __x, \ [all...] |
/haiku-fatelf/src/system/libroot/posix/glibc/include/arch/m68k/ |
H A D | mathimpl.h | 37 __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...] |
/haiku-fatelf/src/system/libroot/posix/glibc/include/arch/m68k/bits/ |
H A D | mathinline.h | 184 __m81_defun (float_type, __CONCAT(__floor,s), (float_type __x)) \ 193 __asm __volatile__ ("fint%.x %1, %0" : "=f" (__result) : "f" (__x)); \ 200 __m81_defun (float_type, __CONCAT(__ceil,s), (float_type __x)) \ 209 __asm __volatile__ ("fint%.x %1, %0" : "=f" (__result) : "f" (__x)); \ 249 (float_type __x, int __n)) \ 252 __asm ("fscale%.l %1, %0" : "=f" (__result) : "dmi" (__n), "0" (__x)); \ 301 (float_type __x, long int __n)) \ 303 return __CONCAT(__scalbn,s) (__x, __n); \ 306 __m81_defun (float_type, __CONCAT(__nearbyint,s), (float_type __x)) \ 314 __asm __volatile__ ("fint%.x %1, %0" : "=f" (__result) : "f" (__x)); \ [all...] |