Searched refs:__val (Results 1 - 16 of 16) sorted by relevance

/haiku/src/system/libroot/posix/glibc/iconv/
H A Dloop.c90 ({ 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 >>
[all...]
H A Dskeleton.c234 ({ 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 >>
[all...]
/haiku/src/system/libroot/posix/glibc/include/arch/m68k/
H A Dmathimpl.h83 __m81_test (long double __val) argument
86 __asm ("ftst%.x %1; fmove%.l %/fpsr,%0" : "=dm" (__fpsr) : "f" (__val));
/haiku/src/system/libroot/posix/glibc/include/bits/
H A Dtypesizes.h59 #define __FSID_T_TYPE struct { int __val[2]; }
H A Dtypes.h65 long __val[2]; member in struct:__anon5461
69 __u_long __val[2]; member in struct:__anon5462
/haiku/headers/cpp/
H A Dbitset77 _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 Dstl_algo.h91 const _Tp& __val,
94 while (__first != __last && *__first != __val)
113 const _Tp& __val,
120 if (*__first == __val) return __first;
123 if (*__first == __val) return __first;
126 if (*__first == __val) return __first;
129 if (*__first == __val) return __first;
135 if (*__first == __val) return __first;
138 if (*__first == __val) return __first;
141 if (*__first == __val) retur
90 find(_InputIter __first, _InputIter __last, const _Tp& __val, input_iterator_tag) argument
112 find(_RandomAccessIter __first, _RandomAccessIter __last, const _Tp& __val, random_access_iterator_tag) argument
190 find(_InputIter __first, _InputIter __last, const _Tp& __val) argument
377 search_n(_ForwardIter __first, _ForwardIter __last, _Integer __count, const _Tp& __val) argument
401 search_n(_ForwardIter __first, _ForwardIter __last, _Integer __count, const _Tp& __val, _BinaryPred __binary_pred) argument
1151 __unguarded_linear_insert(_RandomAccessIter __last, _Tp __val) argument
1163 __unguarded_linear_insert(_RandomAccessIter __last, _Tp __val, _Compare __comp) argument
1178 _Tp __val = *__last; local
1190 _Tp __val = *__last; local
1723 __lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Distance*) argument
1747 lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument
1754 __lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp, _Distance*) argument
1778 lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument
1785 __upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Distance*) argument
1809 upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument
1816 __upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp, _Distance*) argument
1840 upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument
1848 __equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Distance*) argument
1879 equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument
1886 __equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp, _Distance*) argument
1917 equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument
1924 binary_search(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument
1931 binary_search(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument
[all...]
H A Dstl_vector.h300 void assign(size_type __n, const _Tp& __val);
311 void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument
312 { assign((size_type) __n, (_Tp) __val); }
384 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, argument
386 insert(__pos, (size_type) __n, (_Tp) __val);
544 void vector<_Tp, _Alloc>::assign(size_t __n, const value_type& __val) { argument
546 vector<_Tp, _Alloc> __tmp(__n, __val, get_allocator());
550 fill(begin(), end(), __val); local
551 _M_finish = uninitialized_fill_n(_M_finish, __n - size(), __val);
554 erase(fill_n(begin(), __n, __val), en
[all...]
H A Dstl_function.h376 result_type __val; member in struct:constant_void_fun
377 constant_void_fun(const result_type& __v) : __val(__v) {}
378 const result_type& operator()() const { return __val; }
406 inline constant_void_fun<_Result> constant0(const _Result& __val) argument
408 return constant_void_fun<_Result>(__val);
412 inline constant_unary_fun<_Result,_Result> constant1(const _Result& __val) argument
414 return constant_unary_fun<_Result,_Result>(__val);
419 constant2(const _Result& __val) argument
421 return constant_binary_fun<_Result,_Result,_Result>(__val);
H A Dstl_slist.h392 void assign(size_type __n, const _Tp& __val);
403 void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument
404 { assign((size_type) __n, (_Tp) __val); }
664 void remove(const _Tp& __val);
707 void slist<_Tp, _Alloc>::assign(size_type __n, const _Tp& __val) { argument
711 __node->_M_data = __val;
716 _M_insert_after_fill(__prev, __n, __val);
791 void slist<_Tp,_Alloc>::remove(const _Tp& __val) argument
795 if (((_Node*) __cur->_M_next)->_M_data == __val)
H A Dstl_list.h447 void assign(size_type __n, const _Tp& __val);
458 void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument
459 { assign((size_type) __n, (_Tp) __val); }
633 void list<_Tp, _Alloc>::assign(size_type __n, const _Tp& __val) { argument
636 *__i = __val;
638 insert(end(), __n, __val); local
H A Dpthread_alloc406 void construct(pointer __p, const _Tp& __val) { new(__p) _Tp(__val); }
H A Dstl_alloc.h770 void construct(pointer __p, const _Tp& __val) { new(__p) _Tp(__val); } argument
848 void construct(pointer __p, const _Tp& __val) { new(__p) _Tp(__val); } argument
H A Dstl_deque.h640 void assign(size_type __n, const _Tp& __val) { argument
642 fill(begin(), end(), __val); local
643 insert(end(), __n - size(), __val); local
647 fill(begin(), end(), __val); local
662 void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument
663 { assign((size_type) __n, (_Tp) __val); }
H A Dstl_bvector.h627 void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument
628 { assign((size_t) __n, (bool) __val); }
/haiku/headers/cpp/std/
H A Dbastring.h94 size_t __val; local
100 : "=a" (__val)
104 if (__val == 1)

Completed in 99 milliseconds