HomeSort by: relevance | last modified time | path
    Searched defs:__val (Results 1 - 25 of 25) sorted by relevancy

  /src/sys/arch/m68k/include/
lock.h 85 uint8_t __val; local
88 __val = _atomic_cas_8(alp, __SIMPLELOCK_UNLOCKED,
90 } while (__val != __SIMPLELOCK_UNLOCKED);
  /src/sys/arch/hppa/include/
lock.h 66 int __val; local
69 : "=r" (__val) : "r" (__ptr)
72 return __val;
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
atomic_timed_wait.h 209 __platform_wait_t __val;
210 __atomic_load(__addr, &__val, __ATOMIC_RELAXED);
211 if (__val == __old)
292 __platform_wait_t __val; local
293 if (_M_do_spin(__old, std::move(__vfn), __val,
296 return __base_type::_M_w._M_do_wait_until(__base_type::_M_addr, __val, __atime);
303 _M_do_wait_until(_Pred __pred, __platform_wait_t __val,
311 __base_type::_M_addr, __val, __atime)
315 if (__base_type::_M_do_spin(__pred, __val,
330 __platform_wait_t __val; local
344 __platform_wait_t __val; local
365 __platform_wait_t __val; local
    [all...]
atomic_wait.h 110 __platform_wait(const _Tp* __addr, __platform_wait_t __val) noexcept
114 __val, nullptr);
268 __platform_wait_t __val;
269 __atomic_load(__addr, &__val, __ATOMIC_SEQ_CST);
270 if (__val == __old)
273 __atomic_load(__addr, &__val, __ATOMIC_RELAXED);
274 if (__val == __old)
322 __platform_wait_t& __val,
330 __builtin_memcpy(&__val, &__old, sizeof(__val));
392 __platform_wait_t __val; local
406 __platform_wait_t __val; local
445 __detail::__platform_wait_t __val; local
    [all...]
shared_ptr_atomic.h 422 auto __val = _M_val.load(memory_order_relaxed); local
424 __glibcxx_assert(!(__val & _S_lock_bit));
425 if (auto __pi = reinterpret_cast<pointer>(__val))
stl_uninitialized.h 623 typename iterator_traits<_ForwardIterator>::value_type* __val
625 std::_Construct(__val);
627 std::fill(__first, __last, *__val);
664 typename iterator_traits<_ForwardIterator>::value_type* __val local
666 std::_Construct(__val);
668 __first = std::fill_n(__first, __n - 1, *__val);
stl_deque.h 1082 * @param __val Value to be assigned.
1090 assign(size_type __n, const value_type& __val)
1091 { _M_fill_assign(__n, __val); }
1936 _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
1937 { _M_fill_assign(__n, __val); }
1975 _M_fill_assign(size_type __n, const value_type& __val)
1979 std::fill(begin(), end(), __val); local
1980 _M_fill_insert(end(), __n - size(), __val); local
1985 std::fill(begin(), end(), __val); local
chrono_io.h 2201 int_least32_t __val = _S_try_read_digit(__is, __err); local
2202 if (__val == -1) [[unlikely]]
2207 // Cannot overflow __val unless we read more than 9 digits
2211 __val *= 10;
2212 __val += __dig;
2218 if (__builtin_mul_overflow(__val, 10, &__val)
2219 || __builtin_add_overflow(__val, __dig, &__val))
2226 return __val;
2239 int_least32_t __val = _S_read_unsigned(__is, __err, __n); local
2255 int_least32_t __val = -1; local
3389 auto __val = __read_unsigned(__num ? __num : 2); local
3438 auto __val = __read_unsigned(__num ? __num : 2); local
3464 auto __val = __read_signed(__num ? __num : 3); local
3492 auto __val = __read_unsigned(__num ? __num : 2); local
3514 auto __val = __read_unsigned(__num ? __num : 2); local
3606 auto __val = __read_unsigned(2); local
3650 auto __val = __read_unsigned(__num ? __num : 2); local
3751 auto __val = __read_unsigned(__num ? __num : 1); local
3782 auto __val = __read_unsigned(__num ? __num : 2); local
3882 auto __val = __read_unsigned(__num ? __num : 4); local
    [all...]
ranges_algo.h 2944 operator()(const _Tp& __val, const _Tp& __lo, const _Tp& __hi,
2950 auto&& __proj_val = std::__invoke(__proj, __val);
2960 return __val;
3023 auto&& __val = *__first; local
3024 if (__comp_proj(__val, __result.min))
3025 __result.min = std::forward<decltype(__val)>(__val);
3027 __result.max = std::forward<decltype(__val)>(__val);
stl_algo.h 1754 __val = _GLIBCXX_MOVE(*__last); local
1757 while (__comp(__val, __next))
1763 *__last = _GLIBCXX_MOVE(__val);
1780 __val = _GLIBCXX_MOVE(*__i); local
1782 *__first = _GLIBCXX_MOVE(__val);
1946 * @brief Finds the first position in which `__val` could be inserted
1951 * @param __val The search term.
1954 * `__val`, or `end()` if every element is less than `__val`.
1964 const _Tp& __val, _Compare __comp
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
atomic_timed_wait.h 209 __platform_wait_t __val;
210 __atomic_load(__addr, &__val, __ATOMIC_RELAXED);
211 if (__val == __old)
292 __platform_wait_t __val; local
293 if (_M_do_spin(__old, std::move(__vfn), __val,
296 return __base_type::_M_w._M_do_wait_until(__base_type::_M_addr, __val, __atime);
303 _M_do_wait_until(_Pred __pred, __platform_wait_t __val,
311 __base_type::_M_addr, __val, __atime)
315 if (__base_type::_M_do_spin(__pred, __val,
330 __platform_wait_t __val; local
344 __platform_wait_t __val; local
365 __platform_wait_t __val; local
    [all...]
atomic_wait.h 106 __platform_wait(const _Tp* __addr, __platform_wait_t __val) noexcept
110 __val, nullptr);
264 __platform_wait_t __val;
265 __atomic_load(__addr, &__val, __ATOMIC_SEQ_CST);
266 if (__val == __old)
269 __atomic_load(__addr, &__val, __ATOMIC_RELAXED);
270 if (__val == __old)
318 __platform_wait_t& __val,
326 __builtin_memcpy(&__val, &__old, sizeof(__val));
388 __platform_wait_t __val; local
402 __platform_wait_t __val; local
441 __detail::__platform_wait_t __val; local
    [all...]
shared_ptr_atomic.h 405 auto __val = _M_val.load(memory_order_relaxed); local
407 __glibcxx_assert(!(__val & _S_lock_bit));
408 if (auto __pi = reinterpret_cast<pointer>(__val))
stl_uninitialized.h 618 typename iterator_traits<_ForwardIterator>::value_type* __val
620 std::_Construct(__val);
622 std::fill(__first, __last, *__val);
659 typename iterator_traits<_ForwardIterator>::value_type* __val local
661 std::_Construct(__val);
663 __first = std::fill_n(__first, __n - 1, *__val);
stl_deque.h 1082 * @param __val Value to be assigned.
1090 assign(size_type __n, const value_type& __val)
1091 { _M_fill_assign(__n, __val); }
1936 _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
1937 { _M_fill_assign(__n, __val); }
1975 _M_fill_assign(size_type __n, const value_type& __val)
1979 std::fill(begin(), end(), __val); local
1980 _M_fill_insert(end(), __n - size(), __val); local
1985 std::fill(begin(), end(), __val); local
ranges_algo.h 3019 operator()(const _Tp& __val, const _Tp& __lo, const _Tp& __hi,
3025 auto&& __proj_val = std::__invoke(__proj, __val);
3031 return __val;
3094 auto&& __val = *__first; local
3095 if (__comp_proj(__val, __result.min))
3096 __result.min = std::forward<decltype(__val)>(__val);
3098 __result.max = std::forward<decltype(__val)>(__val);
stl_algo.h 1791 __val = _GLIBCXX_MOVE(*__last); local
1794 while (__comp(__val, __next))
1800 *__last = _GLIBCXX_MOVE(__val);
1817 __val = _GLIBCXX_MOVE(*__i); local
1819 *__first = _GLIBCXX_MOVE(__val);
1983 * @brief Finds the first position in which `__val` could be inserted
1988 * @param __val The search term.
1991 * `__val`, or `end()` if every element is less than `__val`.
2001 const _Tp& __val, _Compare __comp
    [all...]
  /src/include/
math.h 26 float __val; member in union:__float_u
31 double __val; member in union:__double_u
36 long double __val; member in union:__long_double_u
87 #define HUGE_VAL __infinity.__val
101 #define HUGE_VALF __infinityf.__val
104 #define HUGE_VALL __infinityl.__val
122 #define NAN __nanf.__val
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/
algo.h 126 find(_IIter __begin, _IIter __end, const _Tp& __val,
128 { return _GLIBCXX_STD_A::find(__begin, __end, __val); }
133 __find_switch(_IIter __begin, _IIter __end, const _Tp& __val,
135 { return _GLIBCXX_STD_A::find(__begin, __end, __val); }
141 const _Tp& __val, random_access_iterator_tag)
151 __comp(__gnu_parallel::_EqualTo<_ValueType, const _Tp&>(), __val); local
157 return _GLIBCXX_STD_A::find(__begin, __end, __val);
163 find(_IIter __begin, _IIter __end, const _Tp& __val)
165 return __find_switch(__begin, __end, __val,
1018 const _Tp& __val, __gnu_parallel::sequential_tag
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/
algo.h 126 find(_IIter __begin, _IIter __end, const _Tp& __val,
128 { return _GLIBCXX_STD_A::find(__begin, __end, __val); }
133 __find_switch(_IIter __begin, _IIter __end, const _Tp& __val,
135 { return _GLIBCXX_STD_A::find(__begin, __end, __val); }
141 const _Tp& __val, random_access_iterator_tag)
151 __comp(__gnu_parallel::_EqualTo<_ValueType, const _Tp&>(), __val); local
157 return _GLIBCXX_STD_A::find(__begin, __end, __val);
163 find(_IIter __begin, _IIter __end, const _Tp& __val)
165 return __find_switch(__begin, __end, __val,
1071 const _Tp& __val, __gnu_parallel::sequential_tag
    [all...]
  /src/external/gpl3/gcc/dist/gcc/ginclude/
stdatomic.h 229 _Bool __val; member in struct:__anon13753
231 unsigned char __val;
  /src/external/gpl3/gcc.old/dist/gcc/ginclude/
stdatomic.h 221 _Bool __val; member in struct:__anon16181
223 unsigned char __val;
  /src/sys/arch/vax/include/
mtpr.h 177 register_t __val; local
180 : "=g" (__val)
182 return __val;
  /src/external/gpl3/gcc/dist/gcc/config/rs6000/
emmintrin.h 848 __v2di __val; local
851 __val = (__v2di)vec_unpackh ((__v4si)__A);
853 return (__m128d)vec_ctf (__val, 0);
  /src/external/gpl3/gcc.old/dist/gcc/config/rs6000/
emmintrin.h 848 __v2di __val; local
851 __val = (__v2di)vec_unpackh ((__v4si)__A);
853 return (__m128d)vec_ctf (__val, 0);

Completed in 58 milliseconds