/haiku/src/system/libroot/posix/glibc/iconv/ |
H A D | loop.c | 90 ({ uint16_t __val = (val); \ 91 ((unsigned char *) (addr))[0] = __val; \ 92 ((unsigned char *) (addr))[1] = __val >> 8; \ 95 ({ uint32_t __val = (val); \ 96 ((unsigned char *) (addr))[0] = __val; \ 97 __val >>= 8; \ 98 ((unsigned char *) (addr))[1] = __val; \ 99 __val >>= 8; \ 100 ((unsigned char *) (addr))[2] = __val; \ 101 __val >>= 8; \ [all …]
|
H A D | skeleton.c | 234 ({ uint16_t __val = (val); \ 235 ((unsigned char *) (addr))[0] = __val; \ 236 ((unsigned char *) (addr))[1] = __val >> 8; \ 239 ({ uint32_t __val = (val); \ 240 ((unsigned char *) (addr))[0] = __val; \ 241 __val >>= 8; \ 242 ((unsigned char *) (addr))[1] = __val; \ 243 __val >>= 8; \ 244 ((unsigned char *) (addr))[2] = __val; \ 245 __val >>= 8; \ [all …]
|
/haiku/headers/cpp/ |
H A D | stl_algo.h | 91 const _Tp& __val, in find() argument 94 while (__first != __last && *__first != __val) in find() 113 const _Tp& __val, in find() argument 120 if (*__first == __val) return __first; in find() 123 if (*__first == __val) return __first; in find() 126 if (*__first == __val) return __first; in find() 129 if (*__first == __val) return __first; in find() 135 if (*__first == __val) return __first; in find() 138 if (*__first == __val) return __first; in find() 141 if (*__first == __val) return __first; in find() [all …]
|
H A D | bitset | 77 _Base_bitset(unsigned long __val); 180 _Base_bitset<_Nw, _WordT>::_Base_bitset(unsigned long __val) 185 for(size_t __i = 0; __i < __n; ++__i, __val >>= 1) 186 if ( __val & 0x1 ) 363 _Base_bitset(unsigned long __val); 435 _Base_bitset<1, _WordT>::_Base_bitset(unsigned long __val) 440 for(size_t __i = 0; __i < __n; ++__i, __val >>= 1) 441 if ( __val & 0x1 ) 512 inline _Base_bitset<1, unsigned long>::_Base_bitset(unsigned long __val) { 513 _M_w = __val; [all …]
|
H A D | stl_vector.h | 300 void assign(size_type __n, const _Tp& __val); 311 void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) in _M_assign_dispatch() argument 312 { assign((size_type) __n, (_Tp) __val); } in _M_assign_dispatch() 384 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, in _M_insert_dispatch() argument 386 insert(__pos, (size_type) __n, (_Tp) __val); in _M_insert_dispatch() 544 void vector<_Tp, _Alloc>::assign(size_t __n, const value_type& __val) { in assign() argument 546 vector<_Tp, _Alloc> __tmp(__n, __val, get_allocator()); in assign() 550 fill(begin(), end(), __val); in assign() 551 _M_finish = uninitialized_fill_n(_M_finish, __n - size(), __val); in assign() 554 erase(fill_n(begin(), __n, __val), end()); in assign()
|
H A D | stl_function.h | 376 result_type __val; member 377 constant_void_fun(const result_type& __v) : __val(__v) {} in constant_void_fun() 378 const result_type& operator()() const { return __val; } in operator() 406 inline constant_void_fun<_Result> constant0(const _Result& __val) in constant0() argument 408 return constant_void_fun<_Result>(__val); in constant0() 412 inline constant_unary_fun<_Result,_Result> constant1(const _Result& __val) in constant1() argument 414 return constant_unary_fun<_Result,_Result>(__val); in constant1() 419 constant2(const _Result& __val) in constant2() argument 421 return constant_binary_fun<_Result,_Result,_Result>(__val); in constant2()
|
H A D | stl_slist.h | 392 void assign(size_type __n, const _Tp& __val); 403 void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) in _M_assign_dispatch() argument 404 { assign((size_type) __n, (_Tp) __val); } in _M_assign_dispatch() 664 void remove(const _Tp& __val); 707 void slist<_Tp, _Alloc>::assign(size_type __n, const _Tp& __val) { in assign() argument 711 __node->_M_data = __val; in assign() 716 _M_insert_after_fill(__prev, __n, __val); in assign() 791 void slist<_Tp,_Alloc>::remove(const _Tp& __val) in remove() argument 795 if (((_Node*) __cur->_M_next)->_M_data == __val) in remove()
|
H A D | stl_list.h | 447 void assign(size_type __n, const _Tp& __val); 458 void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) in _M_assign_dispatch() argument 459 { assign((size_type) __n, (_Tp) __val); } in _M_assign_dispatch() 633 void list<_Tp, _Alloc>::assign(size_type __n, const _Tp& __val) { in assign() argument 636 *__i = __val; in assign() 638 insert(end(), __n, __val); in assign()
|
H A D | stl_alloc.h | 770 void construct(pointer __p, const _Tp& __val) { new(__p) _Tp(__val); } in construct() argument 848 void construct(pointer __p, const _Tp& __val) { new(__p) _Tp(__val); } in construct()
|
H A D | stl_deque.h | 640 void assign(size_type __n, const _Tp& __val) { in assign() argument 642 fill(begin(), end(), __val); in assign() 643 insert(end(), __n - size(), __val); in assign() 647 fill(begin(), end(), __val); in assign() 662 void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) in _M_assign_dispatch() argument 663 { assign((size_type) __n, (_Tp) __val); } in _M_assign_dispatch()
|
H A D | pthread_alloc | 406 void construct(pointer __p, const _Tp& __val) { new(__p) _Tp(__val); }
|
H A D | stl_bvector.h | 627 void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) in _M_assign_dispatch() argument 628 { assign((size_t) __n, (bool) __val); } in _M_assign_dispatch()
|
/haiku/src/system/libroot/posix/glibc/include/arch/m68k/ |
H A D | mathimpl.h | 83 __m81_test (long double __val) in __m81_test() argument 86 __asm ("ftst%.x %1; fmove%.l %/fpsr,%0" : "=dm" (__fpsr) : "f" (__val)); in __m81_test()
|
/haiku/src/system/libroot/posix/glibc/include/bits/ |
H A D | types.h | 65 long __val[2]; member 69 __u_long __val[2]; member
|
H A D | typesizes.h | 59 #define __FSID_T_TYPE struct { int __val[2]; }
|
/haiku/headers/cpp/std/ |
H A D | bastring.h | 94 size_t __val; in release() local 100 : "=a" (__val) in release() 104 if (__val == 1) in release()
|