/haiku/src/add-ons/kernel/busses/scsi/usb/ |
H A D | usb_scsi.h | 44 #define PROTO(__value) ((__value) & PROTO_MASK) 57 #define CMDSET(__value)((__value) & CMDSET_MASK) 75 #define HAS_FIXES(__value, __fix) \ 76 HAS_SET((__value), (__fix))
|
/haiku/headers/cpp/ |
H A D | stl_numeric.h | 80 _Tp __value = *__first; local 82 __value = __value + *__first; 83 *++__result = __value; 104 _Tp __value = *__first; local 106 __value = __binary_op(__value, *__first); 107 *++__result = __value; 128 _Tp __value = *__first; local 131 *++__result = __tmp - __value; 154 _Tp __value = *__first; local 227 iota(_ForwardIterator __first, _ForwardIterator __last, _Tp __value) argument [all...] |
H A D | stl_heap.h | 44 _Distance __holeIndex, _Distance __topIndex, _Tp __value) 47 while (__holeIndex > __topIndex && *(__first + __parent) < __value) { 52 *(__first + __holeIndex) = __value; 76 _Distance __topIndex, _Tp __value, _Compare __comp) 79 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __value)) { 84 *(__first + __holeIndex) = __value; 110 _Distance __len, _Tp __value) 125 __push_heap(__first, __holeIndex, __topIndex, __value); 131 _RandomAccessIterator __result, _Tp __value, _Distance*) 134 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __value); 43 __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value) argument 75 __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value, _Compare __comp) argument 109 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value) argument 130 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value, _Distance*) argument 156 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _Compare __comp) argument 178 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value, _Compare __comp, _Distance*) argument [all...] |
H A D | stl_construct.h | 47 inline void construct(_T1* __p, const _T2& __value) { argument 48 new (__p) _T1(__value);
|
H A D | stl_iterator.h | 360 operator=(const typename _Container::value_type& __value) { argument 361 container->push_back(__value); 399 operator=(const typename _Container::value_type& __value) { argument 400 container->push_front(__value); 440 operator=(const typename _Container::value_type& __value) { argument 441 iter = container->insert(iter, __value); 889 ostream_iterator<_Tp>& operator=(const _Tp& __value) { argument 890 *_M_stream << __value; local
|
H A D | stl_algobase.h | 347 void fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __value) { argument 349 *__first = __value; 353 _OutputIter fill_n(_OutputIter __first, _Size __n, const _Tp& __value) { argument 355 *__first = __value;
|
H A D | stl_list.h | 404 list(size_type __n, const _Tp& __value, argument 407 { insert(begin(), __n, __value); } local 498 void remove(const _Tp& __value); 663 void list<_Tp, _Alloc>::remove(const _Tp& __value) argument 670 if (*__first == __value) erase(__first);
|
H A D | stl_algo.h | 238 void count(_InputIter __first, _InputIter __last, const _Tp& __value, argument 241 if (*__first == __value) 257 count(_InputIter __first, _InputIter __last, const _Tp& __value) { argument 260 if (*__first == __value) 520 _OutputIter __result, const _Tp& __value) { 522 if (*__first != __value) { 542 const _Tp& __value) { 543 __first = find(__first, __last, __value); 546 : remove_copy(++__i, __last, __first, __value); 563 _Tp __value local 519 remove_copy(_InputIter __first, _InputIter __last, _OutputIter __result, const _Tp& __value) argument 541 remove(_ForwardIter __first, _ForwardIter __last, const _Tp& __value) argument 602 _Tp __value = *__first; local [all...] |
H A D | stl_vector.h | 238 vector(size_type __n, const _Tp& __value, argument 241 { _M_finish = uninitialized_fill_n(_M_start, __n, __value); } 261 void _M_initialize_aux(_Integer __n, _Integer __value, __true_type) { argument 264 _M_finish = uninitialized_fill_n(_M_start, __n, __value);
|
H A D | stl_deque.h | 570 deque(size_type __n, const value_type& __value, argument 572 { _M_fill_initialize(__value); } 834 void _M_fill_initialize(const value_type& __value); 1094 deque<_Tp,_Alloc,__bufsize>::_M_fill_initialize(const value_type& __value) { argument 1098 uninitialized_fill(*__cur, *__cur + _S_buffer_size(), __value); 1099 uninitialized_fill(_M_finish._M_first, _M_finish._M_cur, __value);
|
H A D | stl_bvector.h | 526 __BVECTOR(size_type __n, bool __value, argument 531 fill(_M_start._M_p, _M_end_of_storage, __value ? ~0 : 0);
|
/haiku/src/system/libroot/posix/glibc/math/bits/ |
H A D | mathcalls.h | 176 __MATHDECL_1 (int,__isinf,, (_Mdouble_ __value)) __attribute__ ((__const__)); 179 __MATHDECL_1 (int,__finite,, (_Mdouble_ __value)) __attribute__ ((__const__)); 186 __MATHDECL_1 (int,isinf,, (_Mdouble_ __value)) __attribute__ ((__const__)); 190 __MATHDECL_1 (int,finite,, (_Mdouble_ __value)) __attribute__ ((__const__)); 212 __MATHDECL_1 (int,__isnan,, (_Mdouble_ __value)) __attribute__ ((__const__)); 218 __MATHDECL_1 (int,isnan,, (_Mdouble_ __value)) __attribute__ ((__const__)); 329 __MATHDECL_1 (int, __fpclassify,, (_Mdouble_ __value)) 333 __MATHDECL_1 (int, __signbit,, (_Mdouble_ __value))
|
/haiku/src/system/libroot/posix/glibc/stdlib/ |
H A D | stdlib.h | 644 extern int setenv (__const char *__name, __const char *__value, int __replace) 779 extern char *ecvt (double __value, int __ndigit, int *__restrict __decpt, 785 extern char *fcvt (double __value, int __ndigit, int *__restrict __decpt, 791 extern char *gcvt (double __value, int __ndigit, char *__buf) __THROW; 796 extern char *qecvt (long double __value, int __ndigit, 798 extern char *qfcvt (long double __value, int __ndigit, 800 extern char *qgcvt (long double __value, int __ndigit, char *__buf) __THROW; 805 extern int ecvt_r (double __value, int __ndigit, int *__restrict __decpt, 808 extern int fcvt_r (double __value, int __ndigit, int *__restrict __decpt, 812 extern int qecvt_r (long double __value, in [all...] |
/haiku/src/system/libroot/posix/glibc/include/ |
H A D | stdlib.h | 41 extern int __setenv (__const char *__name, __const char *__value,
|
/haiku/src/system/libroot/posix/glibc/iconv/ |
H A D | loop.c | 358 bytebuf[inlen] = state->__value.__wchb[inlen]; 375 state->__value.__wchb[inlen++] = *inptr++; 437 state->__value.__wchb[inlen++] = *inptr++;
|
H A D | skeleton.c | 127 stored in __value.__wchb. Always zero if the converter never 132 * __value: When STORE_REST/UNPACK_BYTES aren't defined and when the 136 in __value.__wch and define STORE_REST/UNPACK_BYTES appropriately. 138 When __value contains lookahead, __count must not be zero, because 790 data->__statep->__value.__wchb[cnt] = *(*inptrp)++;
|
/haiku/src/system/libroot/posix/glibc/wcsmbs/ |
H A D | wchar.h | 79 } __value; /* Value so far. */ member in struct:__anon1
|
/haiku/src/system/libroot/posix/glibc/libio/ |
H A D | libioP.h | 647 extern int _IO_outfloat __P ((double __value, _IO_FILE *__sb, int __type,
|