/haiku/headers/private/shared/ |
H A D | syscall_utils.h | 11 __typeof(err) __result = (err); \ 12 if (__result < 0) { \ 13 errno = __result; \ 16 return __result; \ 21 __typeof(err) __result = (err); \ 23 return __result; \ 28 __typeof(err) __result = (err); \ 30 if (__result < 0) { \ 31 errno = __result; \ 34 return __result; \ [all...] |
/haiku/src/system/libroot/posix/glibc/include/arch/m68k/ |
H A D | mathimpl.h | 39 double __result; local 40 __asm ("frem%.x %1, %0" : "=f" (__result) : "f" (__y), "0" (__x)); 41 return __result; 46 float __result; local 47 __asm ("frem%.x %1, %0" : "=f" (__result) : "f" (__y), "0" (__x)); 48 return __result; 54 long double __result; local 55 __asm ("frem%.x %1, %0" : "=f" (__result) : "f" (__y), "0" (__x)); 56 return __result; 61 double __result; local 68 float __result; local 76 long double __result; local [all...] |
/haiku/headers/cpp/ |
H A D | stl_numeric.h | 78 _OutputIterator __result, _Tp*) 83 *++__result = __value; 85 return ++__result; 91 _OutputIterator __result) 93 if (__first == __last) return __result; 94 *__result = *__first; 95 return __partial_sum(__first, __last, __result, __VALUE_TYPE(__first)); 102 _OutputIterator __result, _Tp*, _BinaryOperation __binary_op) 107 *++__result = __value; 109 return ++__result; 77 __partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Tp*) argument 90 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result) argument 101 __partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Tp*, _BinaryOperation __binary_op) argument 114 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op) argument 125 __adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Tp*) argument 139 adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result) argument 151 __adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Tp*, _BinaryOperation __binary_op) argument 165 adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op) argument 190 _Tp __result = __x; local [all...] |
H A D | stl_uninitialized.h | 43 _ForwardIter __result, 46 return copy(__first, __last, __result); 52 _ForwardIter __result, 55 _ForwardIter __cur = __result; 61 __STL_UNWIND(destroy(__result, __cur)); 68 _ForwardIter __result, _Tp*) 71 return __uninitialized_copy_aux(__first, __last, __result, _Is_POD()); 77 _ForwardIter __result) 79 return __uninitialized_copy(__first, __last, __result, 80 __VALUE_TYPE(__result)); 42 __uninitialized_copy_aux(_InputIter __first, _InputIter __last, _ForwardIter __result, __true_type) argument 51 __uninitialized_copy_aux(_InputIter __first, _InputIter __last, _ForwardIter __result, __false_type) argument 67 __uninitialized_copy(_InputIter __first, _InputIter __last, _ForwardIter __result, _Tp*) argument 76 uninitialized_copy(_InputIter __first, _InputIter __last, _ForwardIter __result) argument 83 uninitialized_copy(const char* __first, const char* __last, char* __result) argument 90 uninitialized_copy(const wchar_t* __first, const wchar_t* __last, wchar_t* __result) argument 101 __uninitialized_copy_n(_InputIter __first, _Size __count, _ForwardIter __result, input_iterator_tag) argument 116 __uninitialized_copy_n(_RandomAccessIter __first, _Size __count, _ForwardIter __result, random_access_iterator_tag) argument 127 __uninitialized_copy_n(_InputIter __first, _Size __count, _ForwardIter __result) argument 135 uninitialized_copy_n(_InputIter __first, _Size __count, _ForwardIter __result) argument 230 __uninitialized_copy_copy(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _ForwardIter __result) argument 246 __uninitialized_fill_copy(_ForwardIter __result, _ForwardIter __mid, const _Tp& __x, _InputIter __first, _InputIter __last) argument [all...] |
H A D | stl_algobase.h | 125 _OutputIter __result, 128 for ( ; __first != __last; ++__result, ++__first) 129 *__result = *__first; 130 return __result; 136 _OutputIter __result, random_access_iterator_tag, _Distance*) 139 *__result = *__first; 141 ++__result; 143 return __result; 148 __copy_trivial(const _Tp* __first, const _Tp* __last, _Tp* __result) { argument 149 memmove(__result, __firs 124 __copy(_InputIter __first, _InputIter __last, _OutputIter __result, input_iterator_tag, _Distance*) argument 135 __copy(_RandomAccessIter __first, _RandomAccessIter __last, _OutputIter __result, random_access_iterator_tag, _Distance*) argument 157 copy(_InputIter __first, _InputIter __last, _OutputIter __result) argument 168 copy(const _Tp* __first, const _Tp* __last, _Tp* __result) argument 176 copy(const _Tp* __first, const _Tp* __last, _Tp* __result) argument 182 copy(_InputIter __first, _InputIter __last, _OutputIter __result) argument 194 copy(_InputIter __first, _InputIter __last, _OutputIter __result) argument 202 copy(const char* __first, const char* __last, char* __result) argument 207 copy(const wchar_t* __first, const wchar_t* __last, wchar_t* __result) argument 220 __copy_backward(_BidirectionalIter1 __first, _BidirectionalIter1 __last, _BidirectionalIter2 __result, bidirectional_iterator_tag, _Distance*) argument 232 __copy_backward(_RandomAccessIter __first, _RandomAccessIter __last, _BidirectionalIter __result, random_access_iterator_tag, _Distance*) argument 259 copy(_BidirectionalIter1 __first, _BidirectionalIter1 __last, _BidirectionalIter2 __result) argument 269 copy(const _Tp* __first, const _Tp* __last, _Tp* __result) argument 279 copy(const _Tp* __first, const _Tp* __last, _Tp* __result) argument 286 copy_backward(_BI1 __first, _BI1 __last, _BI2 __result) argument 297 copy_backward(_BI1 __first, _BI1 __last, _BI2 __result) argument 309 __copy_n(_InputIter __first, _Size __count, _OutputIter __result, input_iterator_tag) argument 322 __copy_n(_RAIter __first, _Size __count, _OutputIter __result, random_access_iterator_tag) argument 331 __copy_n(_InputIter __first, _Size __count, _OutputIter __result) argument 338 copy_n(_InputIter __first, _Size __count, _OutputIter __result) argument 442 const int __result = memcmp(__first1, __first2, min(__len1, __len2)); local 490 const int __result = memcmp(__first1, __first2, min(__len1, __len2)); local [all...] |
H A D | pthread_alloc | 126 __obj * __RESTRICT __result; 138 __result = *__my_free_list; 139 if (__result == 0) { 143 *__my_free_list = __result -> __free_list_link; 144 return (__result); 191 _Pthread_alloc_per_thread_state<_Max_size> *__result = 194 return __result; 206 _Pthread_alloc_per_thread_state<_Max_size> * __result; 213 __result = _S_new_per_thread_state(); 214 if (pthread_setspecific(_S_key, __result)) abor [all...] |
H A D | ropeimpl.h | 391 _RopeLeaf* __result; local 397 __result = _S_new_RopeLeaf(__new_data, __old_len + __len, 402 return __result; 432 _RopeLeaf* __result = _S_leaf_concat_char_iter(__r, __iter, __len); local 433 __stl_assert(__result->_M_refcount == 1); 434 return __result; 446 _RopeConcatenation* __result = local 448 size_t __depth = __result->_M_depth; 453 if (__depth > 20 && (__result->_M_size < 1000 || 458 __balanced = _S_balance(__result); 482 _RopeRep* __result; local 536 _RopeRep* __result; local 661 _RopeRep* __result; local 682 _RopeLeaf* __result; local 708 _RopeSubstring* __result = local 872 bool __result; local 1083 _RopeRep* __result = 0; local 1215 _CharT __result; local 1345 _RopeRep* __result = local 1375 rope<_CharT,_Alloc> __result; local 1453 _CharT* __result = _Data_allocate(__s + 1); local 1482 _CharT* __result = _Data_allocate(_S_rounded_up_size(__s)); local [all...] |
H A D | stl_algo.h | 449 _OutputIter __result, _UnaryOperation __oper) { 450 for ( ; __first != __last; ++__first, ++__result) 451 *__result = __oper(*__first); 452 return __result; 458 _InputIter2 __first2, _OutputIter __result, 460 for ( ; __first1 != __last1; ++__first1, ++__first2, ++__result) 461 *__result = __binary_op(*__first1, *__first2); 462 return __result; 485 _OutputIter __result, 487 for ( ; __first != __last; ++__first, ++__result) 448 transform(_InputIter __first, _InputIter __last, _OutputIter __result, _UnaryOperation __oper) argument 457 transform(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _OutputIter __result, _BinaryOperation __binary_op) argument 484 replace_copy(_InputIter __first, _InputIter __last, _OutputIter __result, const _Tp& __old_value, const _Tp& __new_value) argument 493 replace_copy_if(Iterator __first, Iterator __last, _OutputIter __result, _Predicate __pred, const _Tp& __new_value) argument 519 remove_copy(_InputIter __first, _InputIter __last, _OutputIter __result, const _Tp& __value) argument 530 remove_copy_if(_InputIter __first, _InputIter __last, _OutputIter __result, _Predicate __pred) argument 561 __unique_copy(_InputIter __first, _InputIter __last, _OutputIter __result, _Tp*) argument 574 __unique_copy(_InputIter __first, _InputIter __last, _OutputIter __result, output_iterator_tag) argument 581 __unique_copy(_InputIter __first, _InputIter __last, _ForwardIter __result, forward_iterator_tag) argument 590 unique_copy(_InputIter __first, _InputIter __last, _OutputIter __result) argument 599 __unique_copy(_InputIter __first, _InputIter __last, _OutputIter __result, _BinaryPredicate __binary_pred, _Tp*) argument 613 __unique_copy(_InputIter __first, _InputIter __last, _OutputIter __result, _BinaryPredicate __binary_pred, output_iterator_tag) argument 622 __unique_copy(_InputIter __first, _InputIter __last, _ForwardIter __result, _BinaryPredicate __binary_pred, forward_iterator_tag) argument 633 unique_copy(_InputIter __first, _InputIter __last, _OutputIter __result, _BinaryPredicate __binary_pred) argument 679 reverse_copy(_BidirectionalIter __first, _BidirectionalIter __last, _OutputIter __result) argument 774 _RandomAccessIter __result = __first + (__last - __middle); local 827 rotate_copy(_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last, _OutputIter __result) argument 1372 __merge_sort_loop(_RandomAccessIter1 __first, _RandomAccessIter1 __last, _RandomAccessIter2 __result, _Distance __step_size) argument 1391 __merge_sort_loop(_RandomAccessIter1 __first, _RandomAccessIter1 __last, _RandomAccessIter2 __result, _Distance __step_size, _Compare __comp) argument 1941 merge(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result) argument 1960 merge(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 2077 __merge_backward(_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, _BidirectionalIter3 __result) argument 2106 __merge_backward(_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, _BidirectionalIter3 __result, _Compare __comp) argument 2311 set_union(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result) argument 2335 set_union(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 2358 set_intersection(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result) argument 2377 set_intersection(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 2395 set_difference(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result) argument 2415 set_difference(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 2435 set_symmetric_difference(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result) argument 2459 set_symmetric_difference(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 2686 _ForwardIter1 __result = __last1; local 2711 _ForwardIter1 __result = __last1; local 2746 _BidirectionalIter1 __result = __rresult.base(); local 2772 _BidirectionalIter1 __result = __rresult.base(); local [all...] |
H A D | stl_alloc.h | 161 void* __result = malloc(__n); local 162 if (0 == __result) __result = _S_oom_malloc(__n); 163 return __result; 173 void* __result = realloc(__p, __new_sz); local 174 if (0 == __result) __result = _S_oom_realloc(__p, __new_sz); 175 return __result; 199 void* __result; local 205 __result 214 void* __result; local 259 char* __result = (char*)_Alloc::allocate(__n + _S_extra); local 275 char* __result = (char*) local 408 _Obj* __RESTRICT __result; local 469 char* __result; local 537 _Obj* __result; local 567 void* __result; local [all...] |
H A D | bitset | 155 size_t __result = 0; 160 __result += _Bit_count<true>::_S_bit_count[*__byte_ptr]; 163 return __result; 263 unsigned long __result = 0; 265 __result |= static_cast<unsigned long>( 268 return __result; 401 size_t __result = 0; 405 __result += _Bit_count<true>::_S_bit_count[*__byte_ptr]; 408 return __result; 762 basic_string<_CharT, _Traits, _Alloc> __result; [all...] |
H A D | stl_rope.h | 213 // (SGI compilers in fact allow this, but the __result wouldn't be 412 // __result is not needed. 463 size_t __result; local 465 __result = --_M_refcount; 467 return __result; 658 // In that case, we represent the __result as a special case of 661 // deallocation, we treat the __result as a RopeFunction. 1312 _Cstrptr __result = *__p; local 1315 return __result; 1319 _Cstrptr __result local 1579 _RopeRep* __result = _S_concat(__left, __right); local 1880 _RopeRep* __result = local 1894 _RopeRep* __result = local 1908 _RopeRep* __result = local 1916 _RopeRep* __result = local 1929 _RopeRep* __result = _S_concat(_M_tree_ptr, __y._M_tree_ptr); local 1959 _RopeRep* __result; local 1975 _RopeRep* __result = local 1994 _RopeRep* __result = _S_concat(__left_result, __right); local 2032 _RopeRep* __result = local 2106 _RopeRep* __result = replace(_M_tree_ptr, __p, __p + __n, 0); local 2224 const_iterator __result = search(const_begin() + __pos, const_end(), local [all...] |
H A D | stl_heap.h | 131 _RandomAccessIterator __result, _Tp __value, _Distance*) 133 *__result = *__first; 179 _RandomAccessIterator __result, _Tp __value, _Compare __comp, 182 *__result = *__first; 130 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value, _Distance*) argument 178 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value, _Compare __comp, _Distance*) argument
|
H A D | stl_slist.h | 77 _Slist_node_base* __result = __node; local 79 __result->_M_next = 0; 82 __node->_M_next = __result; 83 __result = __node; 86 return __result; 91 size_t __result = 0; local 93 ++__result; 94 return __result;
|
H A D | stl_vector.h | 436 iterator __result = _M_allocate(__n); local 438 uninitialized_copy(__first, __last, __result); 439 return __result; 441 __STL_UNWIND(_M_deallocate(__result, __n)); 447 iterator __result = _M_allocate(__n); local 449 uninitialized_copy(__first, __last, __result); 450 return __result; 452 __STL_UNWIND(_M_deallocate(__result, __n));
|
H A D | stl_hashtable.h | 348 size_type __result = 0; local 350 __result += 1; 351 return __result; 483 size_type __result = 0; local 487 ++__result; 488 return __result;
|
H A D | stl_list.h | 330 size_type __result = 0; local 331 distance(begin(), end(), __result); local 332 return __result;
|
/haiku/headers/build/gcc-2.95.3/ |
H A D | va-sparc.h | 99 char * __result; \ 104 __result = (pvar); \ 110 __result = (char *) (pvar) - sizeof (TYPE); \ 116 __result = (pvar); \ 123 __result = (pvar); \ 128 __result = * (void **) (pvar); \ 132 (TYPE *) __result;}))
|
/haiku/src/system/libroot/posix/glibc/include/ |
H A D | stdlib.h | 16 extern int __random_r (struct random_data *__buf, int32_t *__result); 23 struct drand48_data *__buffer, double *__result); 26 long int *__result); 29 long int *__result);
|
/haiku/src/system/libroot/posix/glibc/libio/ |
H A D | libio.h | 503 ({ int __result = (__mode); \ 504 if (__result < 0 && ! _IO_fwide_maybe_incompatible) \ 509 __result = (__fp)->_mode; \ 512 __result = (__fp)->_mode; \ 514 __result = _IO_fwide (__fp, __result); \ 515 __result; })
|
/haiku/src/system/libroot/posix/glibc/stdlib/ |
H A D | stdlib.h | 458 int32_t *__restrict __result) __THROW; 520 double *__restrict __result) __THROW; 523 double *__restrict __result) __THROW; 527 long int *__restrict __result) __THROW; 530 long int *__restrict __result) __THROW; 534 long int *__restrict __result) __THROW; 537 long int *__restrict __result) __THROW;
|
/haiku/src/build/libroot/ |
H A D | fs.cpp | 66 __typeof(err) __result = (err); \ 67 if (__result < 0) { \ 68 errno = __result; \ 71 return __result; \
|