| /freebsd-14.2/contrib/llvm-project/libcxx/include/__locale_dir/locale_base_api/ |
| H A D | bsd_locale_fallbacks.h | 32 __libcpp_locale_guard __current(__l); in decltype() 38 __libcpp_locale_guard __current(__l); in __libcpp_btowc_l() 43 __libcpp_locale_guard __current(__l); in __libcpp_wctob_l() 49 __libcpp_locale_guard __current(__l); in __libcpp_wcsnrtombs_l() 54 __libcpp_locale_guard __current(__l); in __libcpp_wcrtomb_l() 60 __libcpp_locale_guard __current(__l); in __libcpp_mbsnrtowcs_l() 66 __libcpp_locale_guard __current(__l); in __libcpp_mbrtowc_l() 71 __libcpp_locale_guard __current(__l); in __libcpp_mbtowc_l() 76 __libcpp_locale_guard __current(__l); in __libcpp_mbrlen_l() 82 __libcpp_locale_guard __current(__l); in __libcpp_localeconv_l() [all …]
|
| /freebsd-14.2/contrib/llvm-project/libcxx/src/ |
| H A D | barrier.cpp | 34 __current = hash<thread::id>()(this_thread::get_id()) % ((__expected + 1) >> 1); in __arrive() local 39 for (;; ++__current) { in __arrive() 40 if (__current == __end_node) in __arrive() 41 __current = 0; in __arrive() 43 if (__current == __last_node && (__current_expected & 1)) { in __arrive() 44 if (__state[__current].__tickets[__round].__phase.compare_exchange_strong( in __arrive() 47 } else if (__state[__current].__tickets[__round].__phase.compare_exchange_strong( in __arrive() 51 if (__state[__current].__tickets[__round].__phase.compare_exchange_strong( in __arrive() 57 __current >>= 1; in __arrive()
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/__ranges/ |
| H A D | lazy_split_view.h | 212 if (__current() == __end) { 220 ++__current(); 224 __current() = ranges::find(std::move(__current()), __end, *__pbegin); 225 if (__current() != __end) { 227 ++__current(); 228 if (__current() == __end) 237 __current() = __b; 238 if (__current() == __end) { 311 auto __cur = __i_.__current(); 331 return __i_.__current(); [all …]
|
| H A D | chunk_by_view.h | 67 _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_View> __find_next(iterator_t<_View> __current) { in __find_next() argument 75 … ranges::adjacent_find(__current, ranges::end(__base_), __reversed_pred), 1, ranges::end(__base_)); in __find_next() 78 _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_View> __find_prev(iterator_t<_View> __current) in __find_prev() argument 82 …_LIBCPP_ASSERT_PEDANTIC(__current != ranges::begin(__base_), "Trying to call __find_prev() on a be… in __find_prev() 88 reverse_view __reversed{subrange{__first, __current}}; in __find_prev() 147 chunk_by_view& __parent, iterator_t<_View> __current, iterator_t<_View> __next) in __iterator() argument 148 : __parent_(std::addressof(__parent)), __current_(__current), __next_(__next) {} in __iterator()
|
| H A D | split_view.h | 142 …split_view<_View, _Pattern>& __parent, iterator_t<_View> __current, subrange<iterator_t<_View>> __… 143 … : __parent_(std::addressof(__parent)), __cur_(std::move(__current)), __next_(std::move(__next)) {}
|
| H A D | filter_view.h | 148 _LIBCPP_HIDE_FROM_ABI constexpr __iterator(filter_view& __parent, iterator_t<_View> __current) 149 : __current_(std::move(__current)), __parent_(std::addressof(__parent)) {}
|
| H A D | elements_view.h | 208 …OM_ABI constexpr explicit __iterator(iterator_t<_Base> __current) : __current_(std::move(__current…
|
| H A D | transform_view.h | 200 _LIBCPP_HIDE_FROM_ABI constexpr __iterator(_Parent& __parent, iterator_t<_Base> __current) 201 : __parent_(std::addressof(__parent)), __current_(std::move(__current)) {}
|
| H A D | zip_view.h | 255 __tuple_or_pair<iterator_t<__maybe_const<_Const, _Views>>...> __current) 256 : __current_(std::move(__current)) {}
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/__functional/ |
| H A D | boyer_moore_searcher.h | 151 _RandomAccessIterator2 __current = __f; in __search() local 155 while (__current <= __last) { in __search() 157 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search() 160 return std::make_pair(__current, __current + __pattern_length_); in __search() 163 difference_type __k = __skip_table[__current[__j - 1]]; in __search() 166 __current += __m; in __search() 168 __current += __suffix_[__j]; in __search() 282 _RandomAccessIterator2 __current = __f; in __search() local 286 while (__current <= __last) { in __search() 291 return std::make_pair(__current, __current + __pattern_length_); in __search() [all …]
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/ |
| H A D | semaphore | 169 auto const __current = _Clock::now(); 170 if (__current >= __abs_time) 173 return try_acquire_for(__abs_time - __current);
|
| H A D | barrier | 246 uint64_t const __current = __phase_arrived_expected.load(memory_order_acquire); 247 return ((__current & __phase_bit) != __phase);
|
| H A D | list | 1188 __node_pointer __current = __e.__ptr_->__as_node(); 1189 this->__delete_node(__current); 1231 __node_pointer __current = __e.__ptr_->__as_node(); 1232 this->__delete_node(__current); 1402 __node_pointer __current = __e.__ptr_->__as_node(); 1403 this->__delete_node(__current); 1438 __node_pointer __current = __e.__ptr_->__as_node(); 1439 this->__delete_node(__current);
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/__iterator/ |
| H A D | bounded_iter.h | 82 _Iterator __current, _Iterator __begin, _Iterator __end) in __bounded_iter() 83 : __current_(__current), __begin_(__begin), __end_(__end) { in __bounded_iter()
|