/freebsd/sys/compat/linuxkpi/common/include/asm/ |
H A D | atomic.h | 180 } __ret = { .val = (old) }, __new = { .val = (new) }; \ 183 LINUXKPI_ATOMIC_8(sizeof(__ret.val) == 1 ||) \ 184 LINUXKPI_ATOMIC_16(sizeof(__ret.val) == 2 ||) \ 185 LINUXKPI_ATOMIC_64(sizeof(__ret.val) == 8 ||) \ 186 sizeof(__ret.val) == 4); \ 188 switch (sizeof(__ret.val)) { \ 192 __ret.u8, __new.u8[0]) && __ret.val == (old)) \ 199 __ret.u16, __new.u16[0]) && __ret.val == (old)) \ 205 __ret.u32, __new.u32[0]) && __ret.val == (old)) \ 211 __ret.u64, __new.u64[0]) && __ret.val == (old)) \ [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
H A D | shift_right.h | 56 _ForwardIterator __ret = __first; in shift_right() 58 if (__ret == __last) { in shift_right() 61 ++__ret; in shift_right() 64 // We have an __n-element scratch space from __first to __ret. in shift_right() 66 // We're essentially doing swap_ranges(__first, __ret, __trail, __lead) in shift_right() 71 auto __lead = __ret; in shift_right() 72 while (__trail != __ret) { in shift_right() 74 std::move(__first, __trail, __ret); in shift_right() 75 return __ret; in shift_right() 84 __trail = std::move(__mid, __ret, __trai in shift_right() 54 _ForwardIterator __ret = __first; shift_right() local [all...] |
H A D | ranges_set_intersection.h | 64 auto __ret = std::__set_intersection<_RangeAlgPolicy>( 71 return {std::move(__ret.__in1_), std::move(__ret.__in2_), std::move(__ret.__out_)}; 90 auto __ret = std::__set_intersection<_RangeAlgPolicy>( 97 return {std::move(__ret.__in1_), std::move(__ret.__in2_), std::move(__ret.__out_)}; 61 auto __ret = std::__set_intersection<_RangeAlgPolicy>( global() local 87 auto __ret = std::__set_intersection<_RangeAlgPolicy>( global() local
|
H A D | ranges_set_symmetric_difference.h | 64 auto __ret = std::__set_symmetric_difference<_RangeAlgPolicy>( 71 return {std::move(__ret.__in1_), std::move(__ret.__in2_), std::move(__ret.__out_)}; 90 auto __ret = std::__set_symmetric_difference<_RangeAlgPolicy>( 97 return {std::move(__ret.__in1_), std::move(__ret.__in2_), std::move(__ret.__out_)}; 61 auto __ret = std::__set_symmetric_difference<_RangeAlgPolicy>( global() local 87 auto __ret = std::__set_symmetric_difference<_RangeAlgPolicy>( global() local
|
H A D | ranges_set_union.h | 67 auto __ret = std::__set_union<_RangeAlgPolicy>( 74 return {std::move(__ret.__in1_), std::move(__ret.__in2_), std::move(__ret.__out_)}; 91 auto __ret = std::__set_union<_RangeAlgPolicy>( 98 return {std::move(__ret.__in1_), std::move(__ret.__in2_), std::move(__ret.__out_)}; 64 auto __ret = std::__set_union<_RangeAlgPolicy>( global() local 88 auto __ret = std::__set_union<_RangeAlgPolicy>( global() local
|
H A D | ranges_copy.h | 46 auto __ret = std::__copy<_RangeAlgPolicy>(std::move(__first), std::move(__last), std::move(__result)); 47 return {std::move(__ret.first), std::move(__ret.second)}; 54 auto __ret = std::__copy<_RangeAlgPolicy>(ranges::begin(__r), ranges::end(__r), std::move(__result)); 55 return {std::move(__ret.first), std::move(__ret.second)}; 43 auto __ret = std::__copy<_RangeAlgPolicy>(std::move(__first), std::move(__last), std::move(__result)); operator() local 51 auto __ret = std::__copy<_RangeAlgPolicy>(ranges::begin(__r), ranges::end(__r), std::move(__result)); operator() local
|
H A D | ranges_copy_backward.h | 44 auto __ret = std::__copy_backward<_RangeAlgPolicy>(std::move(__first), std::move(__last), std::move(__result)); 45 return {std::move(__ret.first), std::move(__ret.second)}; 52 auto __ret = std::__copy_backward<_RangeAlgPolicy>(ranges::begin(__r), ranges::end(__r), std::move(__result)); 53 return {std::move(__ret.first), std::move(__ret.second)}; 41 auto __ret = std::__copy_backward<_RangeAlgPolicy>(std::move(__first), std::move(__last), std::move(__result)); operator() local 49 auto __ret = std::__copy_backward<_RangeAlgPolicy>(ranges::begin(__r), ranges::end(__r), std::move(__result)); operator() local
|
H A D | ranges_minmax_element.h | 51 auto __ret = std::__minmax_element_impl(std::move(__first), std::move(__last), __comp, __proj); local 52 return {__ret.first, __ret.second}; 60 auto __ret = std::__minmax_element_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj); local 61 return {__ret.first, __ret.second};
|
H A D | ranges_unique.h | 52 auto __ret = local 54 return {std::move(__ret.first), std::move(__ret.second)}; 63 auto __ret = std::__unique<_RangeAlgPolicy>( local 65 return {std::move(__ret.first), std::move(__ret.second)};
|
H A D | ranges_binary_search.h | 44 auto __ret = std::__lower_bound<_RangeAlgPolicy>(__first, __last, __value, __comp, __proj); local 45 return __ret != __last && !std::invoke(__comp, __value, std::invoke(__proj, *__ret)); 56 auto __ret = std::__lower_bound<_RangeAlgPolicy>(__first, __last, __value, __comp, __proj); local 57 return __ret != __last && !std::invoke(__comp, __value, std::invoke(__proj, *__ret));
|
H A D | ranges_equal_range.h | 51 …auto __ret = std::__equal_range<_RangeAlgPolicy>(std::move(__first), std::move(__last), __value, _… local 52 return {std::move(__ret.first), std::move(__ret.second)}; 61 auto __ret = local 63 return {std::move(__ret.first), std::move(__ret.second)};
|
H A D | ranges_set_difference.h | 66 auto __ret = std::__set_difference<_RangeAlgPolicy>( 68 return {std::move(__ret.first), std::move(__ret.second)}; 85 auto __ret = std::__set_difference<_RangeAlgPolicy>( 92 return {std::move(__ret.first), std::move(__ret.second)}; 63 auto __ret = std::__set_difference<_RangeAlgPolicy>( global() local 82 auto __ret = std::__set_difference<_RangeAlgPolicy>( global() local
|
H A D | ranges_find_end.h | 56 auto __ret = std::__find_end_impl<_RangeAlgPolicy>( local 66 return {__ret.first, __ret.second}; 77 auto __ret = std::__find_end_impl<_RangeAlgPolicy>( local 87 return {__ret.first, __ret.second};
|
H A D | ranges_search_n.h | 58 auto __ret = std::__search_n_random_access_impl<_RangeAlgPolicy>( in __ranges_search_n_impl() local 60 return {std::move(__ret.first), std::move(__ret.second)}; in __ranges_search_n_impl() 64 …auto __ret = std::__search_n_forward_impl<_RangeAlgPolicy>(__first, __last, __count, __value, __pr… in __ranges_search_n_impl() local 65 return {std::move(__ret.first), std::move(__ret.second)}; in __ranges_search_n_impl()
|
H A D | ranges_unique_copy.h | 78 auto __ret = std::__unique_copy<_RangeAlgPolicy>( 84 return {std::move(__ret.first), std::move(__ret.second)}; 97 auto __ret = std::__unique_copy<_RangeAlgPolicy>( 103 return {std::move(__ret.first), std::move(__ret.second)}; 75 auto __ret = std::__unique_copy<_RangeAlgPolicy>( global() local 94 auto __ret = std::__unique_copy<_RangeAlgPolicy>( global() local
|
H A D | ranges_search.h | 60 auto __ret = std::__search_random_access_impl<_RangeAlgPolicy>( in __ranges_search_impl() local 62 return {__ret.first, __ret.second}; in __ranges_search_impl() 67 auto __ret = in __ranges_search_impl() local 69 return {__ret.first, __ret.second}; in __ranges_search_impl()
|
H A D | ranges_reverse.h | 40 auto __ret = __end; in operator() local 46 return __ret; in operator() 49 auto __ret = __end; in operator() local 58 return __ret; in operator()
|
H A D | ranges_contains_subrange.h | 59 auto __ret = ranges::search( local 61 return __ret.empty() == false; 80 auto __ret = ranges::search(__range1, __range2, __pred, std::ref(__proj1), std::ref(__proj2)); local 81 return __ret.empty() == false;
|
H A D | minmax.h | 45 auto __ret = std::__minmax_element_impl(__t.begin(), __t.end(), __comp, __proj); in minmax() local 46 return pair<_Tp, _Tp>(*__ret.first, *__ret.second); in minmax()
|
/freebsd/contrib/llvm-project/clang/lib/Headers/ |
H A D | __clang_cuda_intrinsics.h | 51 long long __ret; \ 52 memcpy(&__ret, &__tmp, sizeof(__tmp)); \ 53 return __ret; \ 83 double __ret; \ 84 memcpy(&__ret, &__tmp, sizeof(__ret)); \ 85 return __ret; \ 135 long long __ret; \ 136 memcpy(&__ret, &__tmp, sizeof(__tmp)); \ 137 return __ret; \ 169 double __ret; \ [all …]
|
/freebsd/sys/compat/linuxkpi/common/include/linux/ |
H A D | wait.h | 153 int __ret = 0; \ 159 __ret = linux_wait_event_common(&(wqh), &__wq, \ 161 if (__ret != 0) \ 166 if (__ret == -EWOULDBLOCK) \ 167 __ret = !!(cond); \ 168 else if (__ret != -ERESTARTSYS) { \ 169 __ret = __timeout + __start - ticks; \ 171 if (__ret < 1) \ 172 __ret = 1; \ 173 else if (__ret > __timeout) \ [all …]
|
H A D | spinlock.h | 90 int __ret; \ 92 __ret = 1; \ 94 __ret = mtx_trylock(_l); \ 95 if (likely(__ret != 0)) \ 98 __ret; \
|
/freebsd/contrib/llvm-project/libcxx/src/support/runtime/ |
H A D | exception_pointer_msvc.ipp | 52 exception_ptr __ret = nullptr; 54 __ExceptionPtrCopyException(&__ret, __except, __ptr); 55 return __ret; 59 exception_ptr __ret; 60 __ExceptionPtrCurrentException(&__ret); 61 return __ret;
|
/freebsd/contrib/llvm-project/libcxx/include/__atomic/ |
H A D | cxx_atomic_impl.h | 89 _Tp __ret; in __cxx_atomic_load() local 90 __atomic_load(std::addressof(__a->__a_value), std::addressof(__ret), __to_gcc_order(__order)); in __cxx_atomic_load() 91 return __ret; in __cxx_atomic_load() 108 _Tp __ret; in __cxx_atomic_load() local 109 __atomic_load(std::addressof(__a->__a_value), std::addressof(__ret), __to_gcc_order(__order)); in __cxx_atomic_load() 110 return __ret; in __cxx_atomic_load() 116 _Tp __ret; in __cxx_atomic_exchange() local 118 …std::addressof(__a->__a_value), std::addressof(__value), std::addressof(__ret), __to_gcc_order(__o… in __cxx_atomic_exchange() 119 return __ret; in __cxx_atomic_exchange() 124 _Tp __ret; in __cxx_atomic_exchange() local [all …]
|
/freebsd/usr.bin/sdiotool/ |
H A D | linux_compat.h | 48 bool __ret = (cond); \ 49 if (__ret) { \ 53 (__ret); \
|